Measure and Conquer: Domination - A case study

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 191-203

  Fomin, Fedor V ^a   Grandoni, Fabrizio ^b   Kratsch, Dieter ^c  

^a UNIVERSITY OF BERGEN   (Norway)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Algorithms and data structures; Dominating set; Exponential time exact algorithm; NP hard problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; RECURSIVE FUNCTIONS; TREES (MATHEMATICS);

BACKTRACKING ALGORITHMS; DOMINATION; RECURSIVE ALGORITHMS;

ALGORITHMS;

EID: 26444600196     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_16     Document Type: Conference Paper

References (27)

1. M. Alekhnovich, E.A. Hirsch, and D. Itsykon. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), Springer LNCS vol. 3142, 2004, pp. 84-96.
2. n): a no-MIS algorithm. Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOGS 1995), pp. 444-452.
3. J. M. Byskov. Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters, 32:547-556, 2004.
4. n algorithm for k-SAT based on local search. Theoretical Computer Science, 289(1):69-83, 2002.
5. R. G. Downey and M. R. Fellows. Parameterized complexity. Springer-Verlag, New York, 1999.
6. D. Eppstein. Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 329-337.
7. D. Eppstein. Quasiconvex analysis of backtracking algorithms. Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 781-790.
8. F. V. Fomin, D. Kratsch, and I. Todinca. Exact algorithms for treewidth and minimum fill-in. Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), Springer LNCS vol. 3142, 2004, pp. 568-580.
9. F. V. Fomin, D. Kratsch, and G. J. Woeginger. Exact (exponential) algorithms for the dominating set problem. Proceedings of the 30th Workshop on Graph Theoretic Concepts in Computer Science (WG 2004), Springer LNCS vol. 3353, 2004, pp. 245-256.
10. F. Grandoni. Exact Algorithms for Hard Graph Problems. PhD thesis, Università di Roma "Tor Vergata", Roma, Italy, Mar. 2004.
11. F. Grandoni. A note on the complexity of minimum dominating set. Journal of Discrete Algorithms. To appear.
12. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of domination in graphs. Marcel Dekker Inc., New York, 1998.
13. M. Held and R.M. Karp. A dynamic programming approach to sequencing problems. Journal of SIAM, pages 196-210, 1962.
14. K. Iwama and S. Tamaki. Improved upper bounds for 3-SAT. Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), p.328.
15. 0.304n) algorithm for solving maximum independent set problem. IEEE Transactions on Computers, 35(9):847-851, 1986.
16. E.L. Lawler. A note on the complexity of the chromatic number problem. Information Processing Letters 5(3):66-67, 1976.
17. R. Niedermeier and P. Rossmanith. New upper bounds for maximum satisfiability. Journal of Algorithms, 36(1):63-88, 2000.
18. P. Pudlak and R. Impaglazzio. A lower bound for DLL algorithms for k-SAT. A lower bound for DLL algorithms for k-SAT (preliminary version). Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 128-136
19. R. Paturi, P. Pudlak, M. E. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT. Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS 1998), pp. 628-637.
20. B. Randerath and I. Schiermeyer. Exact algorithms for MINIMUM DOMINATING SET. Technical Report, zaik-469, Zentrum für Angewandte Informatik Köln, April 2004.
21. B. Reed. Paths, stars and the number three. Combinatorics, Probability and Computing 5:277-295, 1996.
22. J. M. Robson. Algorithms for maximum independent sets. Journal of Algorithms, 7(3):425-440, 1986.
23. n/4). Technical Report 1251-01, LaBRI, Université Bordeaux I, 2001.
24. U. Schoning. A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS 1999), pp. 410-414.
25. R. Tarjan and A. Trojanowski. Finding a maximum independent set. SIAM Journal on Computing, 6(3):537-546, 1977.
26. R. Williams. A new algorithm for optimal constraint satisfaction and its implications. Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), Springer LNCS vol. 3142, 2004, pp. 1227-1237.
27. G. J. Woeginger. Exact algorithms for NP-hard problems: A survey. Combinatorial Optimization - Eureka, You Shrink, Springer LNCS vol. 2570, 2003, pp. 185-207.