de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Extending Reduction Techniques for the Steiner Tree Problem

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45206

Polzin,  Tobias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45250

Raman,  Rajeev
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

Polzin, T., & Vahdati Daneshmand, S. (2002). Extending Reduction Techniques for the Steiner Tree Problem. In Algorithms - ESA 2002: 10th Annual European Symposium (pp. 795-807). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2F76-E
Abstract
There is no abstract available