Partial multicuts in trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3879 LNCS, Issue , 2006, Pages 320-333

  Levin, Asaf ^a   Segev, Danny ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COSTS; LAGRANGE MULTIPLIERS; PARAMETER ESTIMATION; POLYNOMIALS;

APPROXIMATION ALGORITHMS; LAGRANGIAN MULTIPLIER PRESERVING ALGORITHMS; LAGRANGIAN RELAXATION TECHNIQUE; PARTIAL MULTICUTS;

TREES (MATHEMATICS);

EID: 33745623432     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671411_25     Document Type: Conference Paper

References (16)

1. R. Bar-Yehuda. Using homogeneous weights for approximating the partial cover problem. Journal of Algorithms, 39(2):137-144, 2001.
2. P. Camion. Matrices totalement unimodulaires et problèmes combinatoires. Thèse et Rapport Euratom, Université de Bruxelles, 1963.
3. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. In Proceedings of the 20th Annual IEEE Conference on Computational Complexity, pages 144-153, 2005.
4. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23(4):864-894, 1994.
5. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
6. R. Gandhi, S. Khuller, and A. Srinivasan. Approximation algorithms for partial covering problems. Journal of Algorithms, 53:55-84, 2004.
7. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing, 25(2):235-251, 1996.
8. N. Garg, V. V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18(1):3-20, 1997.
9. D. Golovin, V. Nagarajan, and M. Singh. Approximating the k-multicut problem. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006. To appear.
10. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 731-740, 2002.
11. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM, 48(2):274-296, 2001.
12. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 767-775, 2002.
13. A. Levin and D. Segev. Partial multicuts in trees, 2005. Available at http://www.math.tau.ac.il/~segevd/Papers/PMC-Jour.pdf.
14. N. Megiddo. Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4(4):414-424, 1979.
15. P. Slavík. Improved performance of the greedy algorithm for partial cover. Information Processing Letters, 64(5):251-254, 1997.
16. V. V. Vazirani. Approximation Algorithms. Springer, 2001.