๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Improved Approximation Algorithms for Label Cover Problems

โœ Scribed by Moses Charikar; MohammadTaghi Hajiaghayi; Howard Karloff

Publisher
Springer
Year
2011
Tongue
English
Weight
562 KB
Volume
61
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improved Approximation Algorithms for Un
Improved Approximation Algorithms for Uniform Connectivity Problems
โœ Samir Khuller; Balaji Raghavachari ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 174 KB

The problem of finding minimum-weight spanning subgraphs with a given connectivity requirement is considered. The problem is NP-hard when the connectivity requirement is greater than one. Polynomial time approximation algorithms for various weighted and unweighted connectivity problems are given. Th