English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Approximation Algorithms for Minimum Size 2-connectivity Problems

Krysta, P., & Kumar, V. S. A. (2001). Approximation Algorithms for Minimum Size 2-connectivity Problems. In A. Ferreira, & H. Reichel (Eds.), Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01) (pp. 431-442). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3170-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3172-C
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Krysta, Piotr1, Author           
Kumar, V. S. Anil1, 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-022001
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518148
URI: http://link.springer.de/link/service/series/0558/papers/2010/20100431.pdf
Other: Local-ID: C1256428004B93B8-C8ADD638389A10A2C1256A020060A095-Krysta2001
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Dresden, Germany
Start-/End Date: 2001

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01)
Source Genre: Proceedings
 Creator(s):
Ferreira, Afonso, Editor
Reichel, Horst, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 431 - 442 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2010 Sequence Number: - Start / End Page: - Identifier: -