Constant ratio fixed-parameter approximation of the edge multicut problem

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

Volumn 5757 LNCS, Issue , 2009, Pages 647-658

  Marx, Dániel ^a   Razgon, Igor ^b  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

2-SAT PROBLEMS; CONSTANT RATIO; HARD PROBLEMS; MULTICUTS; PARAMETER-TIME; PARAMETERIZED; PARAMETERIZED COMPLEXITY; UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 70350405159     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_58     Document Type: Conference Paper

References (26)

1. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1-3), 89-113 (2004)
2. Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C., Rosamond, F.: Clustering with partial information. In: MFCS 2008: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science, pp. 144-155. Springer, Heidelberg (2008)
3. Bousquet, N., Daligault, J., Thomasse, S., Yeo, A.: A polynomial kernel for multicut in trees. In: Albers, S., Marion, J.-Y. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009). Leibniz International Proceedings in Informatics, vol. 3, pp. 183-194. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)
4. Cai, L., Huang, X.: Fixed-parameter approximation: conceptual framework and approximability results. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 96-108. Springer, Heidelberg (2006)
5. Chawla, S., Krauthgamer, R., Kumar, R., Rabani, Y., Sivakumar, D.: On the hardness of approximating multicut and sparsest-cut. Comput. Complexity 15(2), 94-114 (2006)
6. Chen, J., Liu, Y., Lu, S., O'Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5) (2008)
7. Chen, Y., Grohe, M., Grüber, M.: On parameterized approximability. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 109-120. Springer, Heidelberg (2006)
8. Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theor. Comput. Sci. 361(2-3), 172-187 (2006)
9. Downey, R., Fellows, M., McCartin, C.: Parameterized approximation algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 121-129. Springer, Heidelberg (2006)
10. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)
11. Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53-61 (2009)
12. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)
13. Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25(2), 235-251 (1996)
14. Guo, J., Hüffner, F., Kenar, E., Niedermeier, R., Uhlmann, J.: Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. European J. Oper. Res. 186(2), 542-553 (2008)
15. Guo, J., Niedermeier, R.: Fixed-parameter tractability and data reduction for multicut in trees. Networks 46(3), 124-135 (2005)
16. Hüffner, F., Niedermeier, R.,Wernicke, S.: Techniques for practical fixed-parameter algorithms. The Computer Journal 51(1), 7-25 (2008)
17. Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 767-775. ACM, New York (2002) (electronic)
18. Liu, Y., Lu, S., Chen, J., Sze, S.-H.: Greedy localization and color-coding: improved matching and packing algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 84-95. Springer, Heidelberg (2006)
19. Marx, D.: Parameterized graph separation problems. Theoretical Computer Science 351(3), 394-406 (2006)
20. Marx, D.: Chordal deletion is fixed-parameter tractable. To appear in Algorithmica (2008)
21. Marx, D.: Parameterized complexity and approximation algorithms. The Computer Journal 51(1), 60-78 (2008)
22. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31 (2006)
23. Razgon, I., O'Sullivan, B.: Almost 2-sat is fixed-parameter tractable. CoRR, abs/0801.1300 (2008)
24. Razgon, I., O'Sullivan, B.: Almost 2-sat is fixed-parameter tractable (extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 551-562. Springer, Heidelberg (2008)
25. Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32(4), 299-301 (2004)
26. Xiao, M.: Algorithms for multiterminal cuts. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) Computer Science - Theory and Applications. LNCS, vol. 5010, pp. 314-325. Springer, Heidelberg (2008)