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: 536691.0, MPI für Informatik / Algorithms and Complexity Group
On the Competitiveness of the Online Asymmetric and Euclidean {Steiner} Tree Problems
Authors:Angelopoulos, Spyros
Language:English
Publisher:Springer
Place of Publication:Berlin
Date of Publication (YYYY-MM-DD):2010
Title of Proceedings:Approximation and Online Algorithms : 7th International Workshop, WAOA 2009
Start Page:1
End Page:12
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Copenhagen, Denmark
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2009-09-10
End Date of Conference/Meeting 
 (YYYY-MM-DD):
2009-09-11
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2011-02-15
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-8F2385D13F0A6BB4C12576C600448558-...
URL:http://dx.doi.org/10.1007/978-3-642-12450-1_1
DOI:10.1007/978-3-642-12450-1_1
ISBN:978-3-642-12449-5
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.