Skip to main content
SpringerLink
Log in

Parameterized Computational Geometry via Decomposition Theorems

  • Conference paper
  • First Online:
Book cover WALCOM: Algorithms and Computation (WALCOM 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11355))

Included in the following conference series:

Abstract

Parameterized complexity is one of the most established algorithmic paradigms to deal with computationally hard problems. In the first two decades, the field largely focused on problems arising from studies of graphs and networks. However, lately the focus has changed substantially and it has started to permeate into other fields such as computational geometry, and computational social choice theory. In this article, we will survey some exciting developments in the emerging field of parameterized computational geometry through our contributions. We will focus on designing efficient parameterized algorithms on unit-disk graphs via new graph decomposition theorems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33(4), 461–493 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM 51(3), 363–384 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (meta) kernelization. J. ACM 63(5), 44:1–44:69 (2016). http://dl.acm.org/citation.cfm?id=2973749

    Article  MathSciNet  MATH  Google Scholar 

  5. Bui, T.N., Peck, A.: Partitioning planar graphs. SIAM J. Comput. 21(2), 203–215 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37(4), 1077–1106 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86(1–3), 165–177 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3

    Book  MATH  Google Scholar 

  9. Cygan, M., Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Minimum bisection is fixed parameter tractable. In: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, 31 May–03 June 2014, pp. 323–332 (2014)

    Google Scholar 

  10. Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: LICS 2006, pp. 411–420 (2006)

    Google Scholar 

  11. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and \(H\)-minor-free graphs. J. ACM 52(6), 866–893 (2005)

    MathSciNet  MATH  Google Scholar 

  12. Demaine, E.D., Hajiaghayi, M.: Bidimensionality. In: Kao, M.Y. (ed.) Encyclo-pedia of Algorithms. Springer, Boston (2008). https://doi.org/10.1007/978-0-387-30162-4

    Chapter  Google Scholar 

  13. Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. Comput. J. 51(3), 292–302 (2008)

    Article  Google Scholar 

  14. Demaine, E.D., Hajiaghayi, M., Mohar, B.: Approximation algorithms via contraction decomposition. Combinatorica 30(5), 533–552 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  16. Dorn, F., Fomin, F.V., Thilikos, D.M.: Subexponential parameterized algorithms. Comput. Sci. Rev. 2(1), 29–39 (2008)

    Article  MATH  Google Scholar 

  17. Eisenstat, D., Klein, P., Mathieu, C.: An efficient polynomial-time approximation scheme for Steiner forest in planar graphs. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 626–638. SIAM (2012)

    Google Scholar 

  18. Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275–291 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  19. Fahad Panolan, S.S., Zehavi, M.: Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2019, to appear)

    Google Scholar 

  20. Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S., Zehavi, M.: Finding, hitting and packing cycles in subexponential time on unit disk graphs. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. LIPIcs, 10–14 July 2017, Warsaw, Poland, vol. 80, pp. 65:1–65:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)

    Google Scholar 

  21. Fomin, F.V., Lokshtanov, D., Saurabh, S.: Excluded grid minors and efficient polynomial-time approximation schemes. J. ACM 65(2), 10:1–10:44 (2018). https://doi.org/10.1145/3154833

    Article  MathSciNet  MATH  Google Scholar 

  22. Fomin, F.V., Thilikos, D.M.: New upper bounds on the decomposability of planar graphs. J. Graph Theory 51(1), 53–81 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  23. Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55–84 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  24. Grohe, M.: Local tree-width, excluded minors, and approximation algorithms. Combinatorica 23(4), 613–632 (2003). https://doi.org/10.1007/s00493-003-0037-9

    Article  MathSciNet  MATH  Google Scholar 

  25. Gu, Q.P., Tamaki, H.: Improved bounds on the planar branchwidth with respect to the largest grid minor size. Algorithmica 64(3), 416–453 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  26. Ito, H., Kadoshita, M.: Tractability and intractability of problems on unit disk graphs parameterized by domain area. In: Proceedings of the 9th International Symposium on Operations Research and Its Applications (ISORA 2010), pp. 120–127 (2010)

    Google Scholar 

  27. Khanna, S., Motwani, R.: Towards a syntactic characterization of PTAS. In: STOC 1996, pp. 329–337. ACM (1996)

    Google Scholar 

  28. Klein, P.N., Marx, D.: A subexponential parameterized algorithm for subset TSP on planar graphs. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1812–1830. SIAM (2014)

    Google Scholar 

  29. Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9, 615–627 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  30. Marx, D.: The square root phenomenon in planar graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, p. 28. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39212-2_4

    Chapter  Google Scholar 

  31. Raghavan, V., Spinrad, J.: Robust algorithms for restricted domains. J. Algorithms 48(1), 160–172 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  32. Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory Ser. B 62(2), 323–348 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bergen, Bergen, Norway

    Fahad Panolan

  2. The Institute of Mathematical Sciences, HBNI, Chennai, India

    Saket Saurabh

  3. Ben-Gurion University, Beersheba, Israel

    Meirav Zehavi

Authors
  1. Fahad Panolan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saket Saurabh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Meirav Zehavi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Saket Saurabh .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Guwahati, Guwahati, India

    Gautam K. Das

  2. Indian Institute of Technology Guwahati, Guwahati, India

    Partha S. Mandal

  3. Indian Statistical Institute, Kolkata, India

    Krishnendu Mukhopadhyaya

  4. Gunma University, Kiryu, Japan

    Shin-ichi Nakano

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Panolan, F., Saurabh, S., Zehavi, M. (2019). Parameterized Computational Geometry via Decomposition Theorems. In: Das, G., Mandal, P., Mukhopadhyaya, K., Nakano, Si. (eds) WALCOM: Algorithms and Computation. WALCOM 2019. Lecture Notes in Computer Science(), vol 11355. Springer, Cham. https://doi.org/10.1007/978-3-030-10564-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-10564-8_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-10563-1

  • Online ISBN: 978-3-030-10564-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation