English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  A Better Approximation Algorithm for Finding Planar Subgraphs

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB2B-D Version Permalink: https://hdl.handle.net/21.11116/0000-000E-3A7D-6
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Calinescu, Gruia1, Author           
Fernandes, Cristina G.2, Author
Finkler, Ulrich1, Author           
Karloff, Howard2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021996
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517790
Other: Local-ID: C1256428004B93B8-872D129EABB9C8C7C12564C3002808D8-Finkler-et-al96
BibTex Citekey: Calinescu-et-al_SODA96
DOI: 10.5555/313852.313869
 Degree: -

Event

show
hide
Title: 7th Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Georgia, USA
Start-/End Date: 1996-01-28 - 1996-01-30

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 1996
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 16 - 25 Identifier: ISBN: 978-0-89871-366-4