Skip to main content
SpringerLink
Log in

Improved Parameterized Algorithms for Planar Dominating Set

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2002 (MFCS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2420))

Abstract

Recently, there has been a lot of interest and progress in low-ering the worst-case time complexity for the Planar Dominating Set problem. In this paper, we present improved parameterized algorithms for the Planar Dominating Set problem. In particular, given a planar graph G and a positive integer k, we can compute a dominating set of size bounded by k or report that no such set exists in time O(227√K n), where n is the number of vertices in G. Our algorithms induce a significant improvement over the previous best algorithm for the problem.

This work was supported in part by DePaul University Competitive Research Grant.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Alber, H. L. Bodlaender, H. Ferneau, AND R. Niedermeier, Fixed parameter algorithms for Dominating Set and related problems on planar graphs, To appear in Algorithmica (2002). Earlier version appeared in LNCS 1851, (2000), pp. 97–110.

    Google Scholar 

  2. J. Alber, H. Fan, M. R. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, AND U. Stege, Refined search tree techniques for Dominating Set on planar graphs, in LNCS 2136, (2001), pp. 111–122.

    Google Scholar 

  3. J. Alber, H. Fernau, AND R. Niedermeier, Parameterized complexity: Exponential speed-up for planar graph problems, in LNCS 2076, (2001), pp. 261–272.

    Google Scholar 

  4. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM 41, (1994), pp. 153–180.

    Article  MATH  Google Scholar 

  5. N. Bansal AND V. Raman, Upper bounds for Max-Sat further improved, LNCS 1741, (1999), pp. 247–258.

    Google Scholar 

  6. L. Cai AND D. Juedes, On the existence of subexponential-time parameterized algorithms, available at http://www.cs.uga.edu/~cai/.

  7. J. Chen, AND I. A. Kanj, Improved exact algorithms for Max-Sat, in LNCS 2286, (2002).

    Google Scholar 

  8. J. Chen, I. A. Kanj, AND W. Jia, Vertex cover: further observations and further improvement, Journal of Algorithms 41, (2001), pp. 280–301.

    Article  MATH  MathSciNet  Google Scholar 

  9. R. G. Downey AND M. R. Fellows, Parameterized Complexity, New York, New York: Springer, (1999).

    Google Scholar 

  10. M. Garey AND D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  11. R. Niedermeier AND P. Rossmanith, Upper bounds for vertex cover further improved, in LNCS 1563, (1999), pp. 561–570.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of CTI, DePaul University, 243 S. Wabash Avenue, Chicago, IL, 60604

    Iyad A. Kanj & Ljubomir Perković

Authors
  1. Iyad A. Kanj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ljubomir Perković
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Iyad A. Kanj .

Editor information

Editors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland

    Krzysztof Diks  & Wojciech Rytter  & 

  2. Department of Computer Science, Liverpool University, Peach Street, Liverpool, L69 7ZF, UK

    Wojciech Rytter

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kanj, I.A., Perković, L. (2002). Improved Parameterized Algorithms for Planar Dominating Set. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-45687-2_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44040-6

  • Online ISBN: 978-3-540-45687-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation