Abstract
Given a graph G cellularly embedded on a surface Σ of genus g, a cut graph is a subgraph of G such that cutting Σ along G yields a topological disk. We provide a fixed parameter tractable approximation scheme for the problem of computing the shortest cut graph, that is, for any ε > 0, we show how to compute a (1 + ε) approximation of the shortest cut graph in time f(ε, g)n 3.
Our techniques first rely on the computation of a spanner for the problem using the technique of brick decompositions, to reduce the problem to the case of bounded tree-width. Then, to solve the bounded tree-width case, we introduce a variant of the surface-cut decomposition of Rué, Sau and Thilikos, which may be of independent interest.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonsma, P.: Surface split decompositions and subgraph isomorphism in graphs on surfaces. In: Proc. of the Symp. on Theoretical Aspects of Computer Science, STACS 2012, pp. 531–542 (2012)
Borradaile, G., Demaine, E.D., Tazari, S.: Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. Algorithmica 68(2), 287–311 (2014)
Borradaile, G., Klein, P.N., Mathieu, C.: An O(nlogn) approximation scheme for Steiner tree in planar graphs. ACM Trans. on Algorithms 5(3) (2009)
Cohen-Addad, V., de Mesmay, A.: A fixed paramater tractable approximation scheme for the optimal cut graph of a surface (2015) (in preparation)
Demaine, E.D., Hajiaghayi, M., Kawarabayashi, K.I.: Contraction decomposition in h-minor-free graphs and algorithmic applications. In: Proc. of the ACM Symp. on Theory of Computing, STOC 2011, pp. 441–450. ACM (2011)
Demaine, E.D., Hajiaghayi, M., Mohar, B.: Approximation algorithms via contraction decomposition. Combinatorica, 533–552 (2010)
Erickson, J.: Combinatorial optimization of cycles and bases. In: Zomorodian, A. (ed.) Computational Topology. Proc. of Symp. in Applied Mathematics, AMS (2012)
Erickson, J., Har-Peled, S.: Optimally cutting a surface into a disk. Discrete & Computational Geometry 31(1), 37–59 (2004)
Erickson, R.E., Monma, C.L., Veinott Jr., A.F.: Send-and-split method for minimum-concave-cost network flows. Mathematics of Operations Research 12(4), 634–664 (1987)
Fomin, F.V., Thilikos, D.M.: On self duality of pathwidth in polyhedral graph embeddings. Journal of Graph Theory 55(1), 42–54 (2007)
Inkmann, T.: Tree-based decompositions of graphs on surfaces and applications to the Traveling Salesman Problem. Ph.D. thesis, Georgia Inst. of Technology (2007)
Marx, D.: Parameterized complexity and approximation algorithms. The Computer Journal 51(1), 60–78 (2008)
Mazoit, F.: Tree-width of hypergraphs and surface duality. J. Comb. Theory, Ser. B 102(3), 671–687 (2012)
Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press (2001)
Pilipczuk, M., Pilipczuk, M., Sankowski, P., van Leeuwen, E.J.: Network sparsification for steiner problems on planar and bounded-genus graphs. In: Proceedings of Foundations of Computer Science (FOCS), pp. 276–285 (2014)
Robertson, N., Seymour, P.: Graph minors. X. obstructions to tree-decomposition. J. Combin. Theory Ser. B 52(2), 153–190 (1991)
Rué, J., Sau, I., Thilikos, D.M.: Dynamic programming for graphs on surfaces. ACM Trans. Algorithms 10(2), 8:1–8:26 (2014)
Thilikos, D.M., Serna, M., Bodlaender, H.L.: Constructive linear time algorithms for small cutwidth and carving-width. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 192–203. Springer, Heidelberg (2000)
Colin de Verdière, É.: Topological algorithms for graphs on surfaces (2012), habilitation thesis. http://www.di.ens.fr/~colin/
Wood, Z., Hoppe, H., Desbrun, M., Schröder, P.: Removing excess topology from isosurfaces. ACM Transactions on Graphics 23(2), 190–208 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen-Addad, V., de Mesmay, A. (2015). A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. In: Bansal, N., Finocchi, I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science(), vol 9294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48350-3_33
Download citation
DOI: https://doi.org/10.1007/978-3-662-48350-3_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48349-7
Online ISBN: 978-3-662-48350-3
eBook Packages: Computer ScienceComputer Science (R0)