✦ LIBER ✦

Hardness of lazy packing and covering

✍ Scribed by Ling Gai; Guochuan Zhang

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 682 KB
Volume: 37
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2008.12.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Algorithms for Ma

Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems

✍ Mingen Lin; Yang Yang; Jinhui Xu 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 430 KB

Packing and covering dense graphs

✍ Noga Alon; Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 1 views

Majorization, packing, covering and matr

Majorization, packing, covering and matroids

✍ Zbigniew Lonc 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Extremal packing and covering sets

✍ Rajinder Jeet Hans 📂 Article 📅 1967 🏛 Springer Vienna 🌐 English ⚖ 440 KB

Multiple packing and covering of spheres

✍ G. Fejes Tóth 📂 Article 📅 1979 🏛 Akadmiai Kiad 🌐 English ⚖ 601 KB

Packing and Covering Groups with Subgrou

Packing and Covering Groups with Subgroups

✍ D. Jungnickel; L. Storme 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 182 KB

We study the problem of covering or packing a finite group with subgroups of a specified order and obtain bounds on the size of such covers and packings. Our main results provide characterizations of the elementary abelian groups by the existence of large packings or small covers, respectively. Henc