Abstract
Approximation algorithms for a class of planar graph problems, including Planar Independent Set, Planar Vertex Cover and Poanar Dominating Set, were intensively studied. The current upper bound on the running time of the polynomial time approximation schemes (PTAS) for these planar graph problems is of 2O(1/∈) n O(1). Here we study the lower bound on the running time of the PTAS for these planar graph problems. We prove that there is no PTAS of time \( 2^{o(\sqrt {1/ \in } )} n^{o(1)} \) for Planar Independent Set, Planar Vertex Cover and Planar Dominating Set unless an unlikely collapse occurs in parameterized complexity theory. For the gap between our lower bound and the current known upper bound, we specifically show that to further improve the upper bound on the running time of the PTAS for PLANAR Vertex Cover, we can concentrate on Planar Vertex Cover on planar graphs of degree bounded by three.
This research is supported in part by US NSF under Grants CCR-0311590 and CCF-0430683.
Please use the following format when citing this chapter: Huang, X., Chen, J., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer), pp. 299–313.
Chapter PDF
Similar content being viewed by others
References
Alber J, Bodlaender HL, Fernau H, Kloks T, and Niedermeier R (2002) Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33:461–493
Alber J, Fernau H, Niedermeier R (2004) Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52:26–56
Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, and Protasi M (1999) Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties. New York, Springer-Verlag
Baker BS (1994) Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM 41:153–180
Bar-Yehuda R and Even S (1982) On approximating a vertex cover for planar graphs. Proceedings of the fourteenth annual ACM symposium on Theory of computing, pp.303–309
Cai L and Chen J (1997) On fixed-parameter tractability and approximability of NP optimization problems. Journal Of Computer and System Sciences 54:465–474
Cai L, Fellows M, Juedes D, Rosamond F (2006) The complexity of polynomialtime approximation. Theory of Computing Systems, to appear.
Cai L and Juedes DW (2003) On the existence of sub-exponential time parameterized algorithms. Journal of Computer and System Sciences 67:789–807
Cesati M and Trevisan L (1997) On the efficiency of polynomial time approximation schemes. Information Processing Letters 64:165–171
Chert J, Chor B, Fellows M, Huang X, Juedes DW, Kanj I and Xia G (2004) Tight lower bounds for parameterized NP-hard problems. Proc. of the 19th Annual IEEE Conference on Computational Complexity, pp. 150–160
Chen J, Huang X, Kanj I and Xia G (2004) Linear FPT reductions and computational lower bounds. Proc. of the 36th ACM Symposium on Theory of Computing, pp. 212–221
Chen J, Kanj I, and Jia W (2001) Vertex cover: further observations and further improvements. Journal of Algorithms 41:280–301
Chen J, Kanj I, Xia G (2003) A note on parameterized exponential time complexity. Tech. Report, DePaul University
Diestel R (2000) Graph theory. New York: Springer
Downey RG and Fellows MR (1999) Parmneterized complexity. Springer, New York
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Huang, X., Chen, J. (2006). On PTAS for Planar Graph Problems. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_24
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)