Fixed-parameter tractability and data reduction for multicut in trees

Networks

Volumn 46, Issue 3, 2005, Pages 124-135

  Guo, Jiong ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Data reduction rules; Exact algorithms; Fixed parameter tractability; MULTICUT IN TREES; NP hard problems; Problem kernel

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; TREES (MATHEMATICS);

EXACT ALGORITHMS; MULTICUT IN TREES; PROBLEM KERNEL;

COMPUTER NETWORKS;

EID: 27744582441     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20081     Document Type: Article

References (24)

1. F.N. Abu-Khzam, R.L. Collins, M.R. Fellows, M.A. Langston, W.H. Suters, and C.T. Symons, Kernelization algorithms for the vertex cover problem: Theory and experiments, Proc of ACM-SIAM ALENEX'04, 2004, pp. 62-69.
2. J. Alber, N. Betzler, and R. Niedermeier, Experiments on data reduction for optimal domination in networks, Originally appeared in Proc of International Network Optimization Conference, 2003, pp. 1-6. Ann Oper Res, 2005 submitted.
3. J. Alber, M.R. Fellows, and R. Niedermeier, Polynomial-time data reduction for dominating set, J ACM 51 (2004), 363-384.
4. R.S. Anand, T. Erlebach, A. Hall, and S. Stefanakos, Call control with k rejections, J Comput Syst Sci 67 (2003), 707-722.
5. L. Cai, J. Chen, R.G. Downey, and M.R. Fellows, Advice classes of parameterized tractability, Ann Pure Appl Logic 84 (1997), 119-138.
6. J. Chen, I.A. Kanj, and W. Jia, Vertex cover: Further observations and further improvements, J Algorithms 41 (2001), 280-301.
7. G. Cǎlinescu, C.G. Fernandes, and B. Reed, Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width, J Algorithms 48 (2003), 333-359.
8. M. Costa, L. Létocart, and F. Roupin, Minimal multicut and maximal integer multiflow: A survey, Eur J Oper Res 162 (2004), 55-69.
9. R.G. Downey, Parameterized complexity for the skeptic, Proc 18th IEEE Annual Conference on Computational Complexity, 2003, pp. 147-169.
10. R.G. Downey and M.R. Fellows, Parameterized complexity, Monographs in Computer Science, Springer-Verlag, New York, 1999.
11. M.R. Fellows, Blow-ups, win/win's, and crown rules: Some new directions in FPT, Proc 29th WG, LNCS 2880, 2003, pp. 1-12.
12. M.R. Fellows, New directions and new challenges in algorithm design and complexity, parameterized, Proc 8th WADS, LNCS 2748, 2003, pp. 505-519.
13. N. Garg, V.V. Vazirani, and M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica 18 (1997), 3-30.
14. J. Guo and R. Niedermeier, Exact algorithms for tree-like weighted set cover, J Disc Algor, 2005, submitted.
15. J. Hromkovič, Algorithmics for hard problems, 2nd Edition, Springer-Verlag, Berlin, 2002.
16. E. Kenar and J. Uhlmann, Multicut in graphs. WSI für Informatik Universität Tübingen, 2005.
17. B. Monien, The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete, SIAM J. Algebraic Discrete Methods 7 (1986), 505-512.
18. R. Niedermeier, Ubiquitous parameterization - Invitation to fixed-parameter algorithms, Proc 29th MFCS, LNCS 3153, 2004, pp. 84-103.
19. R. Niedermeier, Invitation to fixed-parameter algorithms, Oxford University Press, 2005, submitted.
20. R. Niedermeier and P. Rossmanith, A general method to speed up fixed-parameter-tractable algorithms, Inf Process Lett 73 (2000), 125-129.
21. R. Niedermeier and P. Rossmanith, On efficient fixed-parameter algorithms for weighted vertex cover, J Algorithms 47 (2003), 63-77.
22. K. Weihe, Covering trains by stations or the power of data reduction, Proc 1st Workshop on Algorithms and Exper iments, 1998, pp. 1-8. http://rtm.science.unitn.it/alex98/proceedings.html.
23. K. Weihe, On the differences between "practical" and "applied" (invited paper), Proc 4th WAE, LNCS 1982, 2000, pp. 1-10.
24. G.J. Woeginger, Exact algorithms for NP-hard problems: A survey, Proc 5th International Workshop on Combinatorial Optimization, LNCS 2570, 2003, pp. 185-208.