Sciweavers

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

23

ICALP
2003
Springer

favoriteEmaildiscussreport

85views Programming Languages» more ICALP 2003»

An Improved Approximation Algorithm for Vertex Cover with Hard Capacities

14 years 4 months ago

An Improved Approximation Algorithm for Vertex Cover with Hard Capacities

Download www.cs.umd.edu

Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Ko

Real-time Traffic

ICALP 2003 | Theoretical Computer Science |

claim paper

Related Content

» Covering Problems with Hard Capacities

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

» Parameterized Complexity of Generalized Vertex Cover Problems

» Private Approximation of Clustering and Vertex Cover

» Frugality ratios and improved truthful mechanisms for vertex cover

» Primaldual based distributed algorithms for vertex cover with semihard capacities

» A PrimalDual Bicriteria Distributed Algorithm for Capacitated Vertex Cover

» Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

» A new multilayered PCP and the hardness of hypergraph vertex cover

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	ICALP
Authors	Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan

Comments (0)