Home News About Us Contact Contributors Disclaimer Privacy Policy 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:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 427974.0, MPI für Informatik / Algorithms and Complexity Group
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
Authors:Angelopoulos, Spyros
Language:English
Publisher:Springer
Place of Publication:Berlin
Date of Publication (YYYY-MM-DD):2008
Title of Proceedings:Algorithms - ESA 2008 : 16th Annual European Symposium
Start Page:76
End Page:87
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Karlsruhe
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2008-09-15
End Date of Conference/Meeting 
 (YYYY-MM-DD):
2008-09-17
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2009-03-20
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI f�r Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C125756E0038A185-3EB6F5B2FD7D2467C1257551004AD9C1-...
DOI:10.1007/978-3-540-87744-8_7
ISBN:978-3-540-87743-1
Full Text:
You have privileges to view the following file(s):
Angelopoulos.pdf   Uploading file not finished...
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.