Approximating element-weighted vertex deletion problems for the complete k-partite property

Journal of Algorithms

Volumn 42, Issue 1, 2002, Pages 20-40

  Bar Yehuda, Reuven ^a   Rawitz, Dror ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithm; Complete k partite; Edge deletion; Local ratio technique; Vertex deletion

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; OPTIMIZATION; PROBLEM SOLVING;

LOCAL-RATIO TECHNIQUE; VERTEX DELETION;

GRAPH THEORY;

EID: 0036462108     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1196     Document Type: Article

References (22)

1. V. Bafna, P. Berman, and T. Fujito, A 2-approximation algorithm for the undirected feedback vertex set problem, SIAM J. Discrete Math. 12 (1999), 289-297.
2. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Shieber, A unified approach to approximating resource allocation and scheduling, in "32nd ACM Symposium on the Theory of Computing, 2000".
3. R. Bar-Yehuda, "A Linear Time 2-Approximation Algorithm for the Min Clique-Complement Problem," Technical Report CS0933, Technion Haifa, May 1998.
4. R. Bar-Yehuda, One for the price of two: A unified approach for approximating covering problems, Algorithmica 27 (2000), 131-144.
5. R. Bar-Yehuda and S. Even, A linear time approximation algorithm for the weighted vertex cover problem, J. Algorithms 2 (1981), 198-203.
6. R. Bar-Yehuda and S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Math. 25 (1985), 27-46.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1990.
8. M. Dawande, P. Keskinocak, and S. Tayur, "On the Biclique Problem in Bipartite Graphs," GSIA Working Paper 1996-04, Carnegie-Mellon University, 1997.
9. T. Fujito, A primal-dual approach to approximation of node-deletion problems for matroidal properties, in "24th International Colloquium on Automata, Languages and Programming," LNCS, Vol. 1256, pp. 749-759, 1997. This is a preliminary version of [11].
10. T. Fujito, A unified approximation algorithm for node-deletion problems, Discrete Appl. Math. Combin. Oper. Res. Comput. Sci. 86 (1998), 213-231.
11. T. Fujito, Approximating node-deletion problems for martroidal properties, J. Algorithms 31 (1999), 211-227.
12. N. Garg, V. V. Vazirani, and M. Yannakakis, Multiway cuts in directed and node weighted graphs, in "21st International Colloquium on Automata, Languages and Programming, 1994," pp. 487-498.
13. M. X. Goemans and D. P. Williamson, A general approximation technique for constrained forest problems, SIAM J. Comput. 24 (1995), 296-317.
14. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, J. ACM 35 (1988), 921-940.
15. M. R. Henzinger, S. Rao, and H. N. Gabow, Computing vertex connectivity: New bounds from old techniques, in "37th IEEE Symposium on Foundations of Computer Science, 1996," pp. 462-471.
16. D. S. Hochbaum, Approximating clique and biclique problems, J. Algorithms 29 (1998), 174-200.
17. D. S. Hochbaum, Instant recognition of half integrality and 2-approximations, in "APPROX'98 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems," LNCS, Vol. 1444, pp. 99-110, 1998.
18. D. S. Hochbaum, N. Megiddo, J. Naor, and A. Tamir, Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality, Math. Programming 62 (1993), 69-83.
19. J. M. Lewis and M. Yannakakis. The node-deletion problem for hereditary problems is np-complete. J. Comput. System Sci. 20 (1980), 219-230.
20. C. Lund and M. Yannakakis, The approximation of maximum subgraph problems, in "20th International Colloquium on Automata, Languages and Programming," LNCS. Vol. 700, pp. 40-51, July 1993.
21. M. Yannakakis, Edge-deletion problems, SIAM J. Comput. 10 (1981), 297-309.
22. M. Yannakakis, Node-deletion problems on bipartite graphs, SIAM J. Comput. 10 (1981), 310-327.