Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property
- 31 January 2002
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 42 (1) , 20-40
- https://doi.org/10.1006/jagm.2001.1196
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- One for the Price of Two: a Unified Approach for Approximating Covering ProblemsAlgorithmica, 2000
- Computing Vertex Connectivity: New Bounds from Old TechniquesJournal of Algorithms, 2000
- Approximating Node-Deletion Problems for Matroidal PropertiesJournal of Algorithms, 1999
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set ProblemSIAM Journal on Discrete Mathematics, 1999
- Approximating Clique and Biclique ProblemsJournal of Algorithms, 1998
- A unified approximation algorithm for node-deletion problemsDiscrete Applied Mathematics, 1998
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequalityMathematical Programming, 1993
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981