A branch-and-reduce algorithm for finding a minimum independent dominating set

Discrete Mathematics and Theoretical Computer Science

Volumn 14, Issue 1, 2012, Pages 29-42

  Gaspers, Serge ^a   Liedloff, Mathieu ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Exponential time algorithms; Minimum independent dominating set; Minimum maximal independent set

Indexed keywords

BRANCH-AND-REDUCE ALGORITHMS; EXPONENTIAL TIME ALGORITHM; GRAPH G; INDEPENDENT DOMINATING SET; INDEPENDENT SET; LOWER BOUNDS; MAXIMAL INDEPENDENT SET; NON-TRIVIAL ALGORITHMS; NP-HARD PROBLEM; PARAMETERIZED; RUNNING TIME; RUNNING TIME ANALYSIS; TIME ALGORITHMS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY;

GRAPH THEORY;

EID: 84857773113     PISSN: 14627264     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (39)

1. Alber, J., H. L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier, Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica, 33, (2002), pp. 461-493.
2. Allan, R. B. and R. Laskar, On domination and independent domination numbers of a graph, Discrete Mathematics, 23, (1978), pp. 73-76.
3. Angelsmark, O. Constructing Algorithms for Constraint Satisfaction and Related Problems: Methods and Applications, PhD thesis, Linköping University, Sweden, (2005).
4. Bourgeois, M., B. Escoffier, and V. Th. Paschos, Fast Algorithms for min independent dominating set, Proceedings of SIROCCO 2010, LNCS 6058, (2010), pp. 247-261.
5. Bourgeois, M., B. Escoffier, V. Th. Paschos, and J. M. M. van Rooij, Fast algorithms for max independent set, Algorithmica, 62, (2012), pp. 382-415.
6. Broersma, H., T. Kloks, D. Kratsch, and H. Müller, Independent sets in Asteroidal Triple-free graphs, SIAM Journal on Discrete Mathematics, 12, (1999), pp. 276-287.
7. Chang, M.-S., Efficient algorithms for the domination problems on interval and circular-arc graphs, SIAM Journal on Computing, 27, (1998), pp. 1671-1694. (Pubitemid 128691187)
8. Cockayne, E., Domination of undirected graphs-a survey, in Theory and Applications of Graphs, Springer, Berlin (1978), pp. 141-147.
9. Corneil, D.-G. and Y. Perl, Clustering and domination in perfect graphs, Discrete Applied Mathematics, 9, (1984), pp. 27-39.
10. Dantsin E., A. Goerdt, E.A. Hirsch, R. Kannan, J.M. Kleinberg, C.H. Papadimitriou, P. Raghavan, and U. Schning, A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search, Theoretical Computer Science, 289, (2002), pp. 69-83.
11. Damian-Iordache, M. and S. V. Pemmaraju, Hardness of Approximating Independent Domination in Circle Graphs, Proceedings of ISAAC 1999, LNCS 1741, (1999), pp. 56-69.
12. Downey, R. G., Fellows, M. R., and McCartin, C., Parameterized Approximation Problems, Proceedings of IW-PEC 2006, LNCS 4169, (2006), pp. 121-129. (Pubitemid 44609917)
13. Farber, M., Independent domination in chordal graphs, Operation Research Letters, 1, (1982), pp. 134-138.
14. 0.288n) Independent Set Algorithm, Proceedings of SODA 2006, (2006), pp. 18-25. (Pubitemid 43275220)
15. Fomin, F. V., F. Grandoni, and D. Kratsch, Measure and conquer: Domination-A case study, Proceedings of ICALP 2005, LNCS 3380, (2005), pp. 192-203.
16. Fomin, F. V., F. Grandoni, and D. Kratsch, Some new techniques in design and analysis of exact (exponential) algorithms, Bulletin of the EATCS, 87, (2005), pp. 47-77.
17. Fomin, F. V., F. Grandoni, and D. Kratsch, A measure & conquer approach for the analysis of exact algorithms, Journal of the ACM, 56, (2009).
18. Fomin, F. V., D. Kratsch, and G. J. Woeginger, Exact (exponential) algorithms for the dominating set problem, Proceedings of WG 2004, LNCS 3353, (2004), pp. 245-256. (Pubitemid 39743798)
19. Garey, M. R. and D. S. Johnson, Computers and intractability. A guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco, 1979.
20. Gaspers, S., Exponential Time Algorithms: Structures, Measures, and Bounds, PhD thesis, University of Bergen, Norway, (2008).
21. Gaspers, S., D. Kratsch, and M. Liedloff, On Independent Sets and Bicliques in Graphs, Algorithmica, 62, (2012), pp. 637-658.
22. Gaspers, S., and M. Liedloff, A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs, Proceedings of WG 2006, LNCS 4271, (2006), pp. 78-89. (Pubitemid 44923298)
23. Gaspers, S., and G. B. Sorkin, A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between, Journal of Computer and System Sciences, 78, (2012), pp. 305-335.
24. Grandoni, F., A note on the complexity of minimum dominating set, Journal of Discrete Algorithms, 4, (2006), pp. 209-214.
25. Irving, R. W., On approximating the minimum independent dominating set, Information Processing Letters, 37, (1991), pp. 197-200.
26. Halldórsson, M. M., Approximating the minimum maximal independence number, Information Processing Letters, 46, (1993), pp. 169-172.
27. Johnson, D. S., M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, 27, (1988), pp. 119-123. (Pubitemid 18590751)
28. Kneis, J., A. Langer and P. Rossmanith, A Fine-grained Analysis of a Simple Independent Set Algorithm, Proceedings of FSTTCS 2009, LIPIcs 4, (2009), pp. 287-298.
29. Kratsch, D., and L. Stewart, Domination on Cocomparability Graphs, SIAM Journal on Discrete Mathematics, 6, (1993), pp. 400-417.
30. Miller, R. E., and D. E. Muller, A problem of maximum consistent subsets, IBM Research Report, RC-240, J. T. Watson Research Center, Yorktown Heights, NY, 1960.
31. Moser, R. A., and D. Scheder, A full derandomization of Schöning's k-SAT algorithm, Proceedings of STOC 2011, ACM, (2011), pp. 245-252.
32. Moon, J. W., and L. Moser, On cliques in graphs, Israel Journal of Mathematics, 3, (1965), pp. 23-28.
33. Randerath, B., and I. Schiermeyer, Exact algorithms for Minimum Dominating Set, Technical Report zaik-469, Zentrum fur Angewandte Informatik, Köln, Germany, April 2004.
34. Robson, J. M., Algorithms for maximum independent sets, Journal of Algorithms, 7, (1986), pp. 425-440.
35. n/4), Technical Report 1251-01, LaBRI, Univer-sité Bordeaux I, 2001.
36. Tarjan, R. E., and A. E. Trojanowski, Finding a maximum independent set, SIAM Journal on Computing, 6, (1977), pp. 537-546.
37. van Rooij, J. M. M., and H. L. Bodlaender, Exact algorithms for dominating set, Discrete Applied Mathematics, 159, (2011), pp. 2147-2164.
38. van Rooij, J. M. M., J. Nederlof, and T. C. van Dijk, Inclusion/Exclusion Meets Measure and Conquer, Proceedings of ESA 2009, LNCS 5757, (2009), pp. 554-565.
39. Woeginger, G. J., Exact algorithms for NP-hard problems: A survey, Combinatorial Optimization-Eureka, You Shrink!, LNCS 2570, (2003), pp. 185-207. (Pubitemid 137631161)