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

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On the Low-dimensional Steiner Minimum Tree Problem in Hamming Metric

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

Althaus,  Ernst
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

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

Kupilas,  Joschka
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

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

Naujoks,  Rouven
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

Althaus, E., Kupilas, J., & Naujoks, R. (2011). On the Low-dimensional Steiner Minimum Tree Problem in Hamming Metric. In M. Ogihara, & J. Tarui (Eds.), Theory and Applications of Models of Computation (pp. 308-319). Berlin: Springer. doi:10.1007/978-3-642-20877-5_31.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-126B-A
Abstract
There is no abstract available