✦ LIBER ✦

On the complexity of approximatingk-set packing

✍ Scribed by Elad Hazan; Shmuel Safra; Oded Schwartz

Publisher: Springer
Year: 2006
Tongue: English
Weight: 213 KB
Volume: 15
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-006-0205-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of generalized clique pac

The complexity of generalized clique packing

✍ D.G. Corneil 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 332 KB

On the packing density of a fuzzy set

✍ B. D. Kotlyar 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 447 KB

On the facial structure of set packing p

On the facial structure of set packing polyhedra

✍ Manfred W. Padberg 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 791 KB

Simplex pivots on the set packing polyto

Simplex pivots on the set packing polytope

✍ Yoshiro Ikura; George L. Nemhauser 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 706 KB

On the complexity of four polyhedral set

On the complexity of four polyhedral set containment problems

✍ Robert M. Freund; James B. Orlin 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 309 KB

On the complexity of digraph packings

✍ Richard C. Brewster; Romeo Rizzi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 99 KB

Let G be a fixed collection of digraphs. Given a digraph H , a G-packing of H is a collection of vertex disjoint subgraphs of H , each isomorphic to a member of G. For undirected graphs, Loebl and Poljak have completely characterized the complexity of deciding the existence of a perfect G-packing, i