Measure and conquer: A simple O(20.288n) independent set algorithm

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 18-25

  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; Exponentialtime exact algorithms; Independent set problem; NP hard problems

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PROBLEM SOLVING; SET THEORY;

ALGORITHMS AND DATA STRUCTURES; EXPONENTIAL TIME EXACT ALGORITHMS; INDEPENDENT SET PROBLEM;

ALGORITHMS;

EID: 33244481489     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109560     Document Type: Conference Paper

References (20)

1. R. Beigel. Finding maximum independent sets in sparse and general graphs. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 856-857.
2. n), J. Algorithms, 54: 444-453, 2005.
3. J. M. Byskov, Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters 32: 547-556, 2004.
4. J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
5. J. Chen, I. A. Kanj, and G. Xia. Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems. Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003), Springer LNCS vol. 2906, 2003, pp. 148-157.
6. n algorithm for k-SAT based on local search. Theoretical Computer Science, 289(1):69-83, 2002.
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, F. Grandoni, and D. Kratsch. Measure and Conquer: Domination - A Case Study, Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), Springer LNCS vol. 3580, 2005, pp. 191-203.
9. 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.
10. M. R. Garey and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freemann, 1979.
11. 1-ε. Acta Math. 182(1): 105-142, 1999.
12. 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.
13. 0.304n) algorithm for solving maximum independent set problem. IEEE Transactions on Computers, 35(9):847-851, 1986.
14. J. M. Robson. Algorithms for maximum independent sets. Journal of Algorithms, 7(3):425-440, 1986.
15. n/4). Technical Report 1251-01, LaBRI, Université Bordeaux I, 2001.
16. U. Schöning. 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.
17. R. Tarjan. Finding a maximum clique. Technical Report 72-123, Computer Sci. Dept., Cornell Univ., Ithaca, NY, 1972.
18. R. Tarjan and A. Trojanowski. Finding a maximum independent set. SIAM Journal on Computing, 6(3):537-546, 1977.
19. 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.
20. G. J. Woeginger. Exact algorithms for NP-hard problems: A survey. Combinatorial Optimization - Eureka, You Shrink, Springer LNCS vol. 2570, 2003, pp. 185-207.