A better approximation algorithm for finding planar subgraphs

Full Text:

PDF

Buy this Article

Authors:	Gruia Călinescu	College of Computing, Georgia Institute of Technology, Atlanta, GA
	Cristina G. Fernandes	College of Computing, Georgia Institute of Technology, Atlanta, GA
	Ulrich Finkler	Max-Planck-Institut für Informatik, D-66123 Saarbrücken, Germany
	Howard Karloff	College of Computing, Georgia Institute of Technology, Atlanta, GA

	1996 Article
Bibliometrics
· Downloads (6 Weeks): 4 · Downloads (12 Months): 15 · Downloads (cumulative): 368 · Citation Count: 3

Published in:

· Proceeding

SODA '96 Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

Pages 16-25
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1996
table of contents ISBN:0-89871-366-8

Tools and Resources