Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions

Algorithmica (New York)

Volumn 58, Issue 3, 2010, Pages 790-810

  Dorn, Frederic ^a   Penninkx, Eelko ^b   Bodlaender, Hans L ^b   Fomin, Fedor V ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Branchwidth; Exact and parameterized algorithms; Hamiltonian cycle; Planar graphs; Traveling salesman problem; Treewidth

Indexed keywords

BRANCHWIDTH; HAMILTONIAN CYCLE; PARAMETERIZED ALGORITHM; PLANAR GRAPH; TRAVELING SALESMAN; TREE-WIDTH;

ALGORITHMS; DYNAMIC PROGRAMMING; GRAPHIC METHODS; HAMILTONIANS; PARAMETERIZATION; PROBLEM SOLVING; SPHERES; TRAVELING SALESMAN PROBLEM; UNMANNED VEHICLES;

GRAPH THEORY;

EID: 77955653936     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-009-9296-1     Document Type: Article

References (32)

1. J. Alber H.L. Bodlaender H. Fernau T. Kloks R. Niedermeier 2002 Fixed parameter algorithms for dominating set and related problems on planar graphs Algorithmica 33 4 461 493 1016.68055 10.1007/s00453-001-0116-5 1905736
2. J. Alber H. Fernau R. Niedermeier 2003 Graph separators: a parameterized view J. Comput. Syst. Sci. 67 4 808 832 1091.68075 10.1016/S0022-0000(03)00072-2 2036515
3. J. Alber H. Fernau R. Niedermeier 2004 Parameterized complexity: exponential speed-up for planar graph problems J. Algorithms 52 1 26 56 1085.68102 10.1016/j.jalgor.2004.03.005 2063971
4. Arora, S., Grigni, M., Karger, D., Klein, P.N., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 33-41. ACM, New York (1998)
5. Bian, Z., Gu, Q.-P., Marzban, M., Tamaki, H., Yoshitake, Y.: Study on branchwidth and branch decomposition of planar graphs. In: Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 152-165. ACM, New York (2008)
6. H.L. Bodlaender 1993 A tourist guide through treewidth Acta Cybern. 11 1 21 0804.68101 1268488
7. W. Cook P. Seymour 2003 Tour merging via branch-decomposition INFORMS J. Comput. 15 233 248 10.1287/ijoc.15.3.233.16078 1996313 (Pubitemid 39042719)
8. V.G. Deineko B. Klinz G.J. Woeginger 2006 Exact algorithms for the Hamiltonian cycle problem in planar graphs Oper. Res. Lett. 34 2 269 274 1089.05040 10.1016/j.orl.2005.04.013 2204339 (Pubitemid 43242942)
9. E.D. Demaine F.V. Fomin M.T. Hajiaghayi D.M. Thilikos 2005 Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs J. Assoc. Comput. Math. 52 6 866 893 2179550
10. Demaine, E.D., Hajiaghayi, M.T.: Bidimensionality: new connections between FPT algorithms and PTASs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 590-601. ACM, New York (2005)
11. E.D. Demaine M.T. Hajiaghayi 2008 The bidimensionality theory and its algorithmic applications Comput. J. 51 3 292 302 10.1093/comjnl/bxm033 (Pubitemid 351649934)
12. Dorn, F., Fomin, F.V., Thilikos, D.M.: Fast subexponential algorithm for non-local problems on graphs of bounded genus. In: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006). LNCS, vol. 4059, pp. 172-183. Springer, Berlin (2006)
13. Dorn, F., Fomin, F.V., Thilikos, D.M.: Catalan structures and dynamic programming on H-minor-free graphs. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 631-640. ACM, New York (2008)
14. F. Dorn F.V. Fomin D.M. Thilikos 2008 Subexponential parameterized algorithms Comput. Sci. Rev. 2 1 29 39 10.1016/j.cosrev.2008.02.004
15. Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In: Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005). LNCS, vol. 3669, pp. 95-106. Springer, Berlin (2005)
16. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
17. D. Eppstein 1999 Subgraph isomorphism in planar graphs and related problems J. Graph Algorithms Appl. 3 1 27 10.1145/1186810.1186811 1750082
18. F.V. Fomin D.M. Thilikos 2006 New upper bounds on the decomposability of planar graphs J. Graph Theory 51 1 53 81 10.1002/jgt.20121 2184351
19. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
20. 3) time. ACM Trans. Algorithms 4(3) (2008). Article 30
21. M. Held R.M. Karp 1962 A dynamic programming approach to sequencing problems J. SIAM 10 196 210 0106.14103 139493
22. R.Z. Hwang R.C. Chang R.C.T. Lee 1993 The searching over separators strategy to solve some NP-hard problems in subexponential time Algorithmica 9 4 398 423 0797.68161 10.1007/BF01228511 1208569
23. Kloks, T., Lee, C.M., Liu, J.: New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs. In: Proceedings of the 28th International Workshop on Graph-theoretic Concepts in Computer Science (WG 2002). Lecture Notes in Comput. Sci., vol. 2573, pp. 282-295. Springer, Berlin (2002)
24. G. Kreweras 1972 Sur les partitions non croisées d'un circle Discrete Math. 1 4 333 350 0231.05014 10.1016/0012-365X(72)90041-6 309747
25. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds.): The Traveling Salesman Problem. Wiley, New York (1985)
26. R.J. Lipton R.E. Tarjan 1979 A separator theorem for planar graphs SIAM J. Appl. Math. 36 2 177 189 0432.05022 10.1137/0136016 524495
27. R.J. Lipton R.E. Tarjan 1980 Applications of a planar separator theorem SIAM J. Comput. 9 3 615 627 0456.68077 10.1137/0209046 584516
28. Marzban, M., Gu, Q.-P., Jia, X.: Computational study on dominating set problem of planar graphs. In: Proceedings of the Second International Conference on Combinatorial Optimization and Applications (COCOA 2008). Lecture Notes in Comput. Sci., vol. 5165, pp. 89-102. Springer, Berlin (2008)
29. N. Robertson P. Seymour R. Thomas 1994 Quickly excluding a planar graph J. Comb. Theory, Ser. B 62 323 348 0807.05023 10.1006/jctb.1994.1073 1305057
30. N. Robertson P.D. Seymour 1991 Graph minors X. Obstructions to tree-decomposition J. Comb. Theory, Ser. B 52 2 153 190 0764.05069 10.1016/0095-8956(91)90061-N 1110468
31. P. Seymour R. Thomas 1994 Call routing and the ratcatcher Combinatorica 15 217 241 10.1007/BF01215352 1289074
32. Smith, W.D., Wormald, N.C.: Geometric separator theorems and applications. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1998), pp. 232-243. IEEE Comput. Soc., Los Alamitos (1998)