𝔖 Bobbio Scriptorium
✦   LIBER   ✦

TheKr-Packing Problem

✍ Scribed by Venkatesan Guruswami; C. Pandu Rangan; M. S. Chang; G. J. Chang; C. K. Wong


Publisher
Springer Vienna
Year
2001
Tongue
English
Weight
131 KB
Volume
66
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Packing settles powder problem
πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 132 KB

Dynamic sealing ## Packing settles Cutting hydraulic powder problem piston leakage James Walker reports on how its Compression Packing Division was able to resolve a problem for Janssen Pharmaceutics, a subsidiary of Johnson & Johnson, which develops health products for human and veterinary appli

The superstar packing problem
✍ Marek Janata; JΓ‘cint SzabΓ³ πŸ“‚ Article πŸ“… 2009 πŸ› Springer-Verlag 🌐 English βš– 657 KB
The k-piece packing problem
✍ David Hartvigsen; Pavol Hell; JΓ‘cint SzabΓ³ πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 278 KB

## Abstract A __k__‐piece of a graph __G__ is a connected subgraph of __G__ all of whose nodes have degree at most __k__ and at least one node has degree equal to __k__. We consider the problem of covering the maximum number of nodes of a graph by node disjoint __k__‐pieces. When __k__ = 1 this is

A vector-space packing problem
✍ Carl Maneri; Robert Silverman πŸ“‚ Article πŸ“… 1966 πŸ› Elsevier Science 🌐 English βš– 491 KB
On the tree packing problem
✍ Shigeru Masuyama πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 338 KB
On the vertex packing problem
✍ C. De Simone πŸ“‚ Article πŸ“… 1993 πŸ› Springer Japan 🌐 English βš– 546 KB