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: 518260.0, MPI für Informatik / Algorithms and Complexity Group
Online Priority Steiner Tree Problems
Authors:Angelopoulos, Spyros
Language:English
Publisher:Springer
Place of Publication:Berlin/Heidelberg
Date of Publication (YYYY-MM-DD):2009
Title of Proceedings:11th Symposium on Algorithms and Data Structures (WADS)
Start Page:37
End Page:48
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Banff, Canada
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2009-08-21
End Date of Conference/Meeting 
 (YYYY-MM-DD):
2009-08-23
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2010-02-10
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-0BA2B0A603ECEC7AC12576C6004418BF-...
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.