A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Introduction to algorithms
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Mathematical Programming: Series A and B
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
A unified approximation algorithm for node-deletion problems
Discrete Applied Mathematics
Approximating clique and biclique problems
Journal of Algorithms
Approximating node-deletion problems for matroidal properties
Journal of Algorithms
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Instant Recognition of Half Integrality and 2-Approximations
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Computing vertex connectivity: new bounds from old techniques
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A new approach for approximating node deletion problems
Information Processing Letters
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
On incremental maintenance of 2-hop labeling of graphs
Proceedings of the 17th international conference on World Wide Web
Parameterized Graph Editing with Chosen Vertex Degrees
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Combination of parallel machine scheduling and vertex cover
Theoretical Computer Science
| Hi-index | 0.00 |
A k-partite graph is a graph G = (V1,..... Vk, E), where V1 ..... Vk are k nonempty disjoint independent sets of vertices. Such a graph is called complete k-partite if E = ∪i ≠ jVi × Vj. We discuss three variants of the following optimization problem: given a graph and a non-negative weight function on the vertices and edges, find a minimum weight set of vertices and incident edges whose removal from the graph leaves a complete k-partite graph. All the problems we consider are at least as hard to approximate as the weighted vertex cover problem.We use the local-ratio technique to develop 2-approximation algorithms for the first two variants of the problem. In particular, we present the first (linear time) 2-approximation algorithm for the edge clique complement problem. For other previously studied special cases our 2-approximation algorithms are better in terms of time complexity than the existing 2-approximation algorithms. We use approximation preserving reductions in order to (4 - 4/k)-approximate the third variant of the problem.