Exact algorithms and applications for Tree-like Weighted Set Cover

Journal of Discrete Algorithms

Volumn 4, Issue 4, 2006, Pages 608-622

  Guo, Jiong ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

(Weighted) Set Cover; Fixed parameter tractability; Minimum Weighted Edge Cover on acyclic hypergraphs; Multicut in trees; NP hard problems

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY;

ACYCLIC HYPERGRAPHS; FIXED PARAMETER TRACTABILITY; MINIMUM WEIGHTED EDGE COVERS;

TREES (MATHEMATICS);

EID: 33746415328     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.07.005     Document Type: Article

References (32)

1. Alber J., Bodlaender H.L., Fernau H., Kloks T., and Niedermeier R. Fixed parameter algorithms for Dominating Set and related problems on planar graphs. Algorithmica 33 4 (2002) 461-493
2. Betzler N., Niedermeier R., and Uhlmann J. Tree decompositions of graphs: saving memory in dynamic programming. Proc. of CTW04. Electronic Notes in Discrete Mathematics vol. 17 (2004), Elsevier, Amsterdam
3. Bixby R.E., and Wagner D.K. An almost linear time algorithm for graph realization. Math. Oper. Res. 13 (1988) 99-123
4. Bodlaender H.L. Treewidth: algorithmic techniques and results. Proc. of 22nd MFCS. Lecture Notes in Comput. Sci. vol. 1295 (1997), Springer, Berlin 19-36
5. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 (1998) 1-45
6. Chandran L.S., and Grandoni F. Refined memorisation for vertex cover. Inform. Process. Lett. 93 3 (2005) 125-131
7. J. Chen, I.A. Kanj, G. Xia, Simplicity is beauty: improved upper bounds for Vertex Cover, Manuscript, April 2005
8. R.G. Downey, Parameterized complexity for the skeptic, in: Proc. of 18th IEEE Annual Conference on Computational Complexity, 2003, pp. 147-169
9. Downey R.G., and Fellows M.R. Parameterized Complexity. Monographs in Computer Science (1999), Springer, Berlin
10. Duh R.C., and Fürer M. Approximation of k-Set Cover by semi-local optimization. Proc. of 29th STOC (1997), ACM Press, New York 256-264
11. Feige U. A threshold of ln n for approximating set cover. J. ACM 45 (1998) 634-652
12. Fellows M.R. New directions and new challenges in algorithm design and complexity, parameterized. Proc. of 8th WADS. Lecture Notes in Comput. Sci. vol. 2748 (2003), Springer, Berlin 505-519 invited paper
13. Fellows M.R. Blow-ups, win/win's, and crown rules: Some new directions in FPT. Proc. of 29th WG. Lecture Notes in Comput. Sci. vol. 2880 (2003), Springer, Berlin 1-12
14. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W. H. Freeman, New York
15. Garg N., Vazirani V.V., and Yannakakis M. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18 (1997) 3-30
16. Gottlob G., Leone N., and Scarcello F. Hypertree decompositions: a survey. Proc. of 26th MFCS. Lecture Notes in Comput. Sci. vol. 2136 (2001), Springer, Berlin 37-57
17. Guo J., and Niedermeier R. Fixed-parameter tractability and data reduction for Multicut in Trees. Networks 46 3 (2005) 124-135
18. Halldórsson M.M. Approximating k-Set Cover and complementary graph coloring. Proc. of 5th IPCO. Lecture Notes in Comput. Sci. vol. 1084 (1996), Springer, Berlin 118-131
19. Veinott Jr. A.F., and Wagner H.M. Optimal capacity scheduling. Oper. Res. 10 (1962) 518-532
20. Kloks T. Treewidth: Computations and Approximations. Lecture Notes in Comput. Sci. vol. 842 (1994), Springer, Berlin
21. Mecke S., and Wagner D. Solving geometric covering problems by data reduction. Proc. of 12th ESA. Lecture Notes in Comput. Sci. vol. 3221 (2004), Springer, Berlin 760-771
22. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1988), Wiley, New York
23. Niedermeier R. Ubiquitous parameterization-invitation to fixed-parameter algorithms. Proc. of 29th MFCS. Lecture Notes in Comput. Sci. vol. 3153 (2004), Springer, Berlin 84-103
24. R. Niedermeier, Invitation to Fixed-Parameter Algorithms, Oxford University Press, 2005, in press
25. R.D.M. Page, J.A. Cotton, Vertebrate phylogenomics: reconciled trees and gene duplications, in: Proc. of Pacific Symposium on Biocomputing 2002, 2002, pp. 536-547
26. Papadimitriou C.H., and Yannakakis M. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43 (1991) 425-440
27. Robertson N., and Seymour P.D. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7 (1986) 309-322
28. N. Ruf, A. Schöbel, Set covering with almost consecutive ones property, Technical Report, number 91/2003, Georg-August-Universität Göttingen, 2003
29. Tarjan R.E., and Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13 3 (1984) 566-579 Addendum in
30. Tarjan R.E., and Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 14 1 (1985) 254-255
31. Telle J.A., and Proskurowski A. Practical algorithms on partial k-trees with an application to domination-like problems. Proc. of 3rd WADS. Lecture Notes in Comput. Sci. vol. 709 (1993), Springer, Berlin 610-621
32. Tutte W.T. An algorithm for determining whether a given binary matroid is graphic. Proc. Amer. Math. Soc. 11 (1960) 905-917