Local search: Is brute-force avoidable?

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 486-491

  Fellows, Michael R ^a   Rosamond, Frances A ^a   Fomin, Fedor V ^b   Lokshtanov, Daniel ^b   Saurabh, Saket ^b   Villanger, Yngve ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; LOCAL SEARCH (OPTIMIZATION);

BRUTE FORCE SEARCH; COMPLEXITY RESULTS; GENERAL CLASS; LOCAL SEARCH ALGORITHM; ODD CYCLE TRANSVERSALS; RULE OF THUMB; SPARSE GRAPHS; VERTEX DEGREE;

GRAPH THEORY;

EID: 77954452955     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Emile H. L. Aarts and Jan Karel Lenstra. Local Search in Combinatorial Optimization. Princeton University Press, 1997.
2. Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci., 209(1-2):1-45, 1998.
3. Erik D. Demaine and Mohammad Taghi Hajiaghayi. Equivalence of local treewidth and linear local treewidth and its algorithmic applications. In SODA, pages 840-849, 2004.
4. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, and Dimitrios M. Thilikos. Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Transactions on Algorithms, 1(1):33-47, 2005.
5. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, and Dimitrios M. Thilikos. Subexponential parameterized algorithms on bounded-genus graphs and -minor-free graphs. J. ACM, 52(6):866-893, 2005.
6. Rod G. Downey and Michael R. Fellows. Parameterized complexity. Springer-Verlag, New York, 1999.
7. David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27(3):275-291, 2000.
8. David S. Johnson, Christos H. Papadimitriou, and Mihalis Yannakakis. How easy is local search? J. Comput. Syst. Sci., 37(1):79-100, 1988.
9. Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, and Umesh V. Vazirani. On syntactic versus computational views of approximability. SIAM J. Comput., 28(1):164-191, 1998.
10. Samir Khuller, Randeep Bhatia, and Robert Pless. On local search and placement of meters in networks. SIAM J. Comput., 32(2):470-487, 2003.
11. Andrei Krokhin and Dániel Marx. On the hardness of losing weight. In ICALP, volume 5125, pages 662-673, 2008.
12. S. Lin and B. W. Kernighan. An effective heuristic algorithm for traveling-salesman problem. Operations Research, 21:498-516, 1973.
13. Dániel Marx. Local search. Parameterized Complexity Newsletter, 3:7-8, 2008.
14. Dániel Marx. Searching the k-change neighborhood for tsp is w[1]-hard. Oper. Res. Lett., 36(1):31-36, 2008.
15. Wil Michiels, Emile H. L. Aarts, and Jan Korst. Theoretical Aspects of Local Search. Springer-Verlag, 2007.
16. Christos H. Papadimitriou and Kenneth Steiglitz. On the complexity of local search for the traveling salesman problem. SIAM J. Comput., 6(1):76-83, 1977.
17. Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
18. Neil Robertson and Paul D. Seymour. Graph minors. v. excluding a planar graph. J. Comb. Theory, Ser. B, 41(1):92-114, 1986.
19. Neil Robertson and Paul D. Seymour. Graph minors. xvi. excluding a non-planar graph. J. Comb. Theory, Ser. B, 89(1):43-76, 2003.
20. Saket Saurabh. Exact Algorithms for Optimization and Parameterized versions of some Graph Theoretic Problems. Homi Bhabha National Institute, Thesis, 2008.