scientific article; zbMATH DE number 1947055

zbMATH Open1013.90117MaRDI QIDQ4411285FDOQ4411285

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (23)

• Approximation algorithms for partial vertex covers in trees
• Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
• An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem
• 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
• An approximation algorithm for the partial vertex cover problem in hypergraphs
• A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
• 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 minimum weight partial connected set cover problem
• Approximation algorithms for the partition vertex cover problem
• Heuristics for automated knowledge source integration and service composition
• 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
• Title not available (Why is that?)
• Approximation of Partial Capacitated Vertex Cover
• Approximation algorithms for partial covering problems

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)