English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Dependent Randomized Rounding: The Bipartite Case

MPS-Authors
/persons/resource/persons44338

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

/persons/resource/persons44857

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

/persons/resource/persons45687

Wahlström,  Magnus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Doerr, B., Künnemann, M., & Wahlström, M. (2011). Dependent Randomized Rounding: The Bipartite Case. In M. Müller-Hannemann, & R. Werneck (Eds.), 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (pp. 96-106). Philadelphia, PA: SIAM. doi:10.1137/1.9781611972917.10.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-1211-0
Abstract
There is no abstract available