✦ LIBER ✦

Improved Approximation Algorithms for Geometric Set Cover

✍ Scribed by Kenneth L. Clarkson; Kasturi Varadarajan

Publisher: Springer
Year: 2006
Tongue: English
Weight: 238 KB
Volume: 37
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-006-1273-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Algorithms for La

Improved Approximation Algorithms for Label Cover Problems

✍ Moses Charikar; MohammadTaghi Hajiaghayi; Howard Karloff 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 562 KB

Improved approximation algorithms for co

Improved approximation algorithms for connected sensor cover

✍ Stefan Funke; Alex Kesselman; Fabian Kuhn; Zvi Lotker; Michael Segal 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 536 KB

Near-Linear Approximation Algorithms for

Near-Linear Approximation Algorithms for Geometric Hitting Sets

✍ Pankaj K. Agarwal; Esther Ezra; Micha Sharir 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 837 KB

Approximation algorithms for geometric m

Approximation algorithms for geometric median problems

✍ Jyh-Han Lin; Jeffrey Scott Vitter 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Computational experience with approximat

Computational experience with approximation algorithms for the set covering problem

✍ Tal Grossman; Avishai Wool 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 722 KB

The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of nine different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorith

An Improved Approximation Algorithm for

An Improved Approximation Algorithm for the Most Points Covering Problem

✍ Hossein Ghasemalizadeh; Mohammadreza Razzazi 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 461 KB