A Better Approximation Algorithm for Finding Planar Subgraphs

Calinescu, Gruia; Fernandes, Cristina G.; Finkler, Ulrich; Karloff, Howard

Local TagsRelease HistoryDetailsSummary

A Better Approximation Algorithm for Finding Planar Subgraphs

Calinescu, G., Fernandes, C. G., Finkler, U., & Karloff, H. (1998). A Better Approximation Algorithm for Finding Planar Subgraphs. Journal of Algorithms, 27(2), 269-302.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3741-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3742-A

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Calinescu, Gruia¹, Author
Fernandes, Cristina G.², Author
Finkler, Ulrich¹, Author
Karloff, Howard², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2Max Planck Society, ou_persistent13

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1998

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517774
Other: Local-ID: C1256428004B93B8-7A2F451BC6F3E61CC125648400507F84-Finkler-et-al97

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Algorithms

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 27 (2) Sequence Number: - Start / End Page: 269 - 302 Identifier: ISSN: 0196-6774