Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG

Information Processing Letters

Volumn 104, Issue 2, 2007, Pages 65-72

  Raman, Venkatesh ^a   Saurabh, Saket ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Directed feedback arc set; Exact algorithm; Graph algorithms; Max cut; Parameterized complexity

Indexed keywords

DIRECTED FEEDBACK ARC SETS; EXACT ALGORITHM; GRAPH ALGORITHMS; PARAMETERIZED COMPLEXITY;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY; PARAMETERIZATION;

PROBLEM SOLVING;

EID: 34447622462     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.05.014     Document Type: Article

References (23)

1. Björklund A., and Husfeldt T. Exact algorithms for exact satisfiability and number of perfect matchings. The Proceedings of International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Comput. Sci. vol. 4051 (2006) 548-559
2. Byskov J.M. Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters 32 6 (2004) 547-556
3. Downey R., and Fellows M. Parameterized Complexity (1999), Springer-Verlag
4. n). Journal of Algorithms 54 2 (2005) 168-204
5. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer-Verlag
6. 0.288 n) independent set algorithm, in: The Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp. 18-25
7. Fomin F.V., Grandoni F., and Kratsch D. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the European Association for Theoretical Computer Science 87 (2005) 47-77
8. Fomin F.V., Grandoni F., and Kratsch D. Measure and conquer: domination-a case study. The Proceedings of International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Comput. Sci. vol. 3580 (2005) 191-203
9. Fomin F.V., Grandoni F., Pyatkin A.V., and Stepanov A.A. Bounding the number of minimal dominating sets: a measure and conquer approach. The Proceedings of International Symposium on Algorithms and Computation (ISAAC). Lecture Notes in Comput. Sci. vol. 3827 (2005) 573-582
10. Gramm J., Hirsch E.A., Niedermeier R., and Rossmanith P. Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics 130 2 (2003) 139-155
11. Gurevich Y., and Shelah S. Expected computation time for Hamiltonian path problem. SIAM Journal on Computing 16 3 (1987) 486-502
12. K. Iwama, S. Tamaki, Improved upper bounds for 3-SAT, in: The Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, p. 328
13. Kneis J., Mölle D., Richter S., and Rossmanith P. Algorithms based on the treewidth of sparse graphs. The Proceedings of Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Comput. Sci. vol. 3787 (2005) 385-396
14. Mahajan M., and Raman V. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms 31 2 (1999) 335-354
15. Niedermeier R. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications (2006), Oxford University Press
16. Poljak S., and Turzik D. A polynomial algorithm for constructing a large bipartite subgraph, with an application to a satisfiability problem. Canad. J. Math. 34 3 (1982) 519-524
17. E. Prieto, The method of extremal structure on the k-maximum cut problem, in: The Proceedings of Computing: The Australasian Theory Symposium (CATS), 2005, pp. 119-126
18. Raman V., and Saurabh S. Parameterized algorithms for feedback set problems and their duals in tournaments. Theoretical Computer Science 351 3 (2006) 446-458
19. Raman V., Saurabh S., and Sikdar S. Improved exact exponential algorithms for vertex bipartization and other problems. The proceedings of Italian Conference on Theoretical Computer Science (ICTCS). Lecture Notes in Comput. Sci. vol. 3701 (2005) 375-389
20. V. Raman, S. Saurabh, S. Sikdar, Efficient exact algorithms through enumerating maximal independent sets and other techniques, Theory of Computing Systems, Springer-Verlag
21. n / 4)?, Technical Report 1251-01, LaBRI, Université Bordeaux I, 2001
22. Williams R. A new algorithm for optimal 2-constraint satisfaction and its implications. The Proceedings of International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Comput. Sci. vol. 3142 (2004) 1227-1237
23. Woeginger G. Exact algorithms for NP-hard problems: A survey. Combinatorial Optimization-Eureka! You Shrink!. Lecture Notes in Comput. Sci. vol. 2570 (2003) 185-207