scientific article; zbMATH DE number 1947055

MaRDI QIDQ4411285zbMATH OpenFDO

Authors Eran Halperin, Aravind Srinivasan

Publication date 7 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2462/24620161.htm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem
• Approximation algorithms for partial covering problems
• scientific article; zbMATH DE number 1754596
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs

Cited in

(23)

• Approximation algorithms for partial covering problems
• Approximation algorithms for partial vertex covers in trees
• An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem
• Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
• Lift \& project systems performing on the partial-vertex-cover polytope
• Improved Upper Bounds for Partial Vertex Cover
• The approximability of partial vertex covers in trees
• An improved approximation algorithm for vertex cover with hard capacities
• A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
• An approximation algorithm for the partial vertex cover problem in hypergraphs
• Local ratio method on partial set multi-cover
• Approximating partially bounded degree deletion on directed graphs
• Approximation algorithms for the partition vertex cover problem
• On combinatorial approximation of covering 0-1 integer programs and partial set cover
• Approximation algorithms for the partition vertex cover problem
• Heuristics for automated knowledge source integration and service composition
• Approximation algorithms for minimum weight partial connected set cover problem
• Capacitated Arc Stabbing
• Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
• Improved non-approximability results for minimum vertex cover with density constraints
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 1617261 (Why is no real title available?)
• Approximation of Partial Capacitated Vertex Cover

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411285)