Fast algorithms for min independent dominating set

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

Volumn 6058 LNCS, Issue , 2010, Pages 247-261

  Bourgeois, Nicolas ^a   Escoffier, Bruno ^a   Paschos, Vangelis Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

BRANCH-AND-REDUCE ALGORITHMS; BRANCHING ALGORITHMS; EXACT COMPUTATIONS; EXPONENTIAL ALGORITHMS; FAST ALGORITHMS; INDEPENDENT DOMINATING SET; POLYNOMIAL SPACE; RUNNING TIME;

APPROXIMATION ALGORITHMS;

EID: 77954418305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13284-1_20     Document Type: Conference Paper

References (11)

1. Alimonti, P., Calamoneri, T.: Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. In: D'Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol. 1197, pp. 2-16. Springer, Heidelberg (1997)
2. Bourgeois, N., Escoffier, B., Paschos, V.T.: Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithm. In: Proc. of WADS 2009. LNCS, vol. 5664, pp. 507-518. Springer, Heidelberg (2009)
3. Bourgeois, N., Escoffier, B., Paschos, V.T.: Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. 109(16), 950-954 (2009)
4. Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32(6), 547-556 (2004)
5. Cygan, M., Kowalik, L., Wykurz, M.: Exponential-time approximation of weighted set cover. Inf. Process. Lett. 109(16), 957-961 (2009)
6. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure and conquer approach for the analysis of exact algorithms. Journal of the ACM 56(5) (2009)
7. Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)
8. Gaspers, S., Liedloff, M.: A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 78-89. Springer, Heidelberg (2006)
9. Halldórsson, M.M.: Approximating the minimum maximal independence number. Inform. Process. Lett. 46, 169-172 (1993)
10. Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inform. Process. Lett. 27, 119-123 (1988)
11. Moon, J.W., Moser, L.: On cliques in graphs. Israel J. of Mathematics 3, 23-28 (1965)