New Approximation Algorithms for Minimum Cycle Bases of Graphs

Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios

doi:10.1007/s00453-009-9313-4

Local TagsRelease HistoryDetailsSummary

New Approximation Algorithms for Minimum Cycle Bases of Graphs

Kavitha, T., Mehlhorn, K., & Michail, D. (2011). New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica, 59(4), 471-488. doi:10.1007/s00453-009-9313-4.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-125C-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-A8DB-C

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Kavitha, Telikepalli, Author
Mehlhorn, Kurt¹, Author
Michail, Dimitrios¹, Author

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

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2012-03-23Date issued: 2011

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 618754
DOI: 10.1007/s00453-009-9313-4
URI: http://dx.doi.org/10.1007/s00453-009-9313-4
Other: Local-ID: C1256428004B93B8-9DF47B615A95B3B9C12579CA0043E5C0-KavithaALG2011

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Algorithmica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: New York, NY : Springer

Pages: - Volume / Issue: 59 (4) Sequence Number: - Start / End Page: 471 - 488 Identifier: ISSN: 0178-4617