Approximation of Partial Capacitated Vertex Cover

DOI10.1007/978-3-540-75520-3_31zbMath1151.90566OpenAlexW2157300207MaRDI QIDQ5900368

Julián Mestre, Reuven Bar Yehuda, Guy Flysher, Dror Rawitz

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_31

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (8)

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs ⋮ Capacitated Arc Stabbing ⋮ On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs ⋮ On the partial vertex cover problem in bipartite graphs -- a parameterized perspective ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems ⋮ Approximation algorithms for the partition vertex cover problem ⋮ Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs ⋮ On capacitated covering with unit balls

This page was built for publication: Approximation of Partial Capacitated Vertex Cover