This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baker, B., Approximate Algorithms for NP-Complete Problems on Planar Graphs, 1983 FOCS Symposium.
Garey, M., Johnson, D.S., The Rectilinear Steiner Tree Problem is NP-Complete, SIAM J. Appl. Math., 1977.
Lipton and Tarjan, Applications of a Planar Separator Theorem, 1977 FOCS Symposium
Lipton and Tarjan, A Separator Theorem for Planar Graphs, Conference on Theoretical Computer Science, Univ. of Waterloo, 1977.
Papadimitriou, C., Yannakakis, M., Worst Case Ratios for Planar Graphs, 1981 FOCS Symposium.
Venkatesan, S., Matchings and Independent Sets in Planar graphs, December 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Venkatesan, S.M. (1985). Approximation algorithms for planar matching. In: Maheshwari, S.N. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1985. Lecture Notes in Computer Science, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16042-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-16042-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16042-7
Online ISBN: 978-3-540-39722-9
eBook Packages: Springer Book Archive