The parameterized complexity of κ-flip local search for SAT and MAX SAT

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

Volumn 5584 LNCS, Issue , 2009, Pages 276-283

  Szeider, Stefan ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LITERALS; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MAX-SAT; PARAMETERIZED COMPLEXITY; PRACTICAL ALGORITHMS; SEARCH SPACES; TRUTH ASSIGNMENT; TRUTH VALUES; WORST-CASE COMPLEXITY;

LEARNING ALGORITHMS;

EID: 70350655223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02777-2_27     Document Type: Conference Paper

References (15)

1. n local search. Theoret. Comput. Sci. 289(1), 69-83 (2002)
2. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Heidelberg (1999)
3. Fellows, M.R.: Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 1-12. Springer, Heidelberg (2003)
4. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, vol. XIV. Springer, Heidelberg (2006)
5. Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures.
6. Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Elsevier/Morgan Kaufmann (2004)
7. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. of Computer and System Sciences 63(4), 512-530 (2001)
8. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. of Computer and System Sciences 37(1), 79-100 (1988)
9. Khuller, S., Bhatia, R., Pless, R.: On local search and placement of meters in networks. SIAM J. Comput. 32(2), 470-487 (2003)
10. Krokhin, A.A., Marx, D.: On the hardness of losing weight. In: Aceto, L., Damga°rd, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 662-673. Springer, Heidelberg (2008)
11. Marx, D.: Searching the k-change neighborhood for TSP is W[1]-hard. Oper. Res. Lett. 36(1), 31-36 (2008)
12. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford (2006)
13. Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. of Computer and System Sciences 67(4), 757-771 (2003)
14. Samer, M., Szeider, S.: Fixed-parameter tractability. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, ch. 13, pp. 425-454. IOS Press, Amsterdam (2009)
15. Yagiura, M., Ibaraki, T.: Analyses on the 2 and 3-flip neighborhoods for the MAX SAT. J. Comb. Optim. 3(1), 95-114 (1999)