English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Randomized Rounding in the Presence of a Cardinality Constraint

MPS-Authors
/persons/resource/persons44338

Doerr,  Benjamin
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 Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Doerr, B., & Wahlström, M. (2009). Randomized Rounding in the Presence of a Cardinality Constraint. In I. Finocchi, & J. Hershberger (Eds.), Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (pp. 162-174). Philadelphia, PA: SIAM.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-18C6-D
Abstract
There is no abstract available