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

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Randomized Rounding for Routing and Covering Problems: Experiments and Improvements

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

Doerr,  Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

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

Künnemann,  Marvin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

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

Wahlström,  Magnus
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

Doerr, B., Künnemann, M., & Wahlström, M. (2010). Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. In P. Festa (Ed.), Experimental Algorithms (pp. 190-201). Berlin: Springer. doi:10.1007/978-3-642-13193-6_17.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-16C9-8
Abstract
There is no abstract available