English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  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 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96) (pp. 16-25). New York: 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/11858/00-001M-0000-0014-AB2C-B
Genre: Conference Paper

Files

show Files

Locators

show

Creators

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

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021996
 Publication Status: Issued
 Pages: -
 Publishing info: New York : acm
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517790
Other: Local-ID: C1256428004B93B8-872D129EABB9C8C7C12564C3002808D8-Finkler-et-al96
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Georgia, USA
Start-/End Date: 1996

Legal Case

show

Project information

show

Source 1

show
hide
Title: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York : acm
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 16 - 25 Identifier: -