Randomized Rounding in the Presence of a Cardinality Constraint

Doerr, Benjamin; Wahlström, Magnus

doi:10.1145/2594409

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

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 Resource

Link
(Any fulltext)

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., & Wahlström, M. (2014). Randomized Rounding in the Presence of a Cardinality Constraint. ACM Journal of Experimental Algorithmics, 19(1): 1.2, pp. 1-18. doi:10.1145/2594409.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-426F-C

Abstract

There is no abstract available