English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A Better Approximation Algorithm for Finding Planar Subgraphs

MPS-Authors
/persons/resource/persons44216

Calinescu,  Gruia
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44420

Finkler,  Ulrich
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Calinescu, G., Fernandes, C. G., Finkler, U., & Karloff, H. (1996). A Better Approximation Algorithm for Finding Planar Subgraphs. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 16-25). New York, NY: ACM.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AB2B-D
Abstract
There is no abstract available