scientific article; zbMATH DE number 1947055
From MaRDI portal
Publication:4411285
zbMath1013.90117MaRDI QIDQ4411285
Aravind Srinivasan, Eran Halperin
Publication date: 7 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620161.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (11)
Capacitated Arc Stabbing ⋮ Improved Upper Bounds for Partial Vertex Cover ⋮ A primal-dual approximation algorithm for partial vertex cover: Making educated guesses ⋮ Local ratio method on partial set multi-cover ⋮ The Approximability of Partial Vertex Covers in Trees ⋮ Heuristics for automated knowledge source integration and service composition ⋮ Lift \& project systems performing on the partial-vertex-cover polytope ⋮ Approximation algorithms for minimum weight partial connected set cover problem ⋮ An approximation algorithm for the partial vertex cover problem in hypergraphs ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems ⋮ Approximating Partially Bounded Degree Deletion on Directed Graphs
This page was built for publication:
