English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems

MPS-Authors
/persons/resource/persons44020

Angelopoulos,  Spyros
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Angelopoulos, S. (2010). On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems. In E. Bampis, & K. Jansen (Eds.), Approximation and Online Algorithms (pp. 1-12). Berlin: Springer. doi:10.1007/978-3-642-12450-1_1.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-169B-1
Abstract
There is no abstract available