Home News About Us Contact Contributors Disclaimer Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents



ID: 518148.0, MPI für Informatik / Algorithms and Complexity Group
Approximation Algorithms for Minimum Size 2-connectivity Problems
Authors:Krysta, Piotr; Kumar, V. S. Anil
Language:English
Publisher:Springer
Place of Publication:Berlin, Germany
Date of Publication (YYYY-MM-DD):2001
Title of Proceedings:Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01)
Start Page:431
End Page:442
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Dresden, Germany
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2001
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-C8ADD638389A10A2C1256A020060A095-...
URL:http://link.springer.de/link/service/series/0558/p...
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.