Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

118

Voted

COCOON
2010
Springer

153views Combinatorics» more COCOON 2010»

Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems

15 years 7 months ago

Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems

Download www.cse.psu.edu

Piotr Berman, Marek Karpinski, Andrzej Lingas

Real-time Traffic

COCOON 2010 | Combinatorics |

claim paper

Related Content

» Distributed Approximation of Capacitated Dominating Sets

» On ColumnRestricted and Priority Covering Integer Programs

» Weighted Geometric Set Cover via QuasiUniform Sampling

» Geometric Set Cover and Hitting Sets for Polytopes in R3

» Algorithms for twobox covering

» Approximation Algorithms for Capacitated Rectangle Stabbing

» Practical Discrete Unit Disk Cover Using an Exact LineSeparable Algorithm

» A PTAS for a Disc Covering Problem Using WidthBounded Separators

» A PrimalDual Approximation Algorithm for Partial Vertex Cover Making Educated Guesses

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2010
Where	COCOON
Authors	Piotr Berman, Marek Karpinski, Andrzej Lingas

Comments (0)