Non-independent Randomized Rounding

Benjamin Doerr

Non-independent Randomized Rounding

Benjamin Doerr

Christian-Albrechts-University Kiel

Research output: Contribution to conference › Paper › peer-review

Abstract

We investigate an extension of the randomized rounding technique introduced by Raghavan and Thompson. Whereas their approach only requires that each variable is rounded with probabilities given by its fractional part, we also impose this condition on several sums of variables. Thus in particular our roundings are not independent. We show that such non-independent randomized roundings exist if and only if the hypergraph corresponding to these dependencies is totally unimodular.

Original language	English
Pages	568-569
Number of pages	2
Publication status	Published - 15 Apr 2004
Externally published	Yes
Event	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA., United States Duration: 11 Jan 2004 → 13 Jan 2004

Conference

Conference	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Country/Territory	United States
City	New Orleans, LA.
Period	11/01/04 → 13/01/04

Cite this

@conference{a3f2ba0cfa064e20a82d84da88dbbb58,

title = "Non-independent Randomized Rounding",

abstract = "We investigate an extension of the randomized rounding technique introduced by Raghavan and Thompson. Whereas their approach only requires that each variable is rounded with probabilities given by its fractional part, we also impose this condition on several sums of variables. Thus in particular our roundings are not independent. We show that such non-independent randomized roundings exist if and only if the hypergraph corresponding to these dependencies is totally unimodular.",

author = "Benjamin Doerr",

year = "2004",

month = apr,

day = "15",

language = "English",

pages = "568--569",

note = "Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 11-01-2004 Through 13-01-2004",

}

TY - CONF

T1 - Non-independent Randomized Rounding

AU - Doerr, Benjamin

PY - 2004/4/15

Y1 - 2004/4/15

N2 - We investigate an extension of the randomized rounding technique introduced by Raghavan and Thompson. Whereas their approach only requires that each variable is rounded with probabilities given by its fractional part, we also impose this condition on several sums of variables. Thus in particular our roundings are not independent. We show that such non-independent randomized roundings exist if and only if the hypergraph corresponding to these dependencies is totally unimodular.

AB - We investigate an extension of the randomized rounding technique introduced by Raghavan and Thompson. Whereas their approach only requires that each variable is rounded with probabilities given by its fractional part, we also impose this condition on several sums of variables. Thus in particular our roundings are not independent. We show that such non-independent randomized roundings exist if and only if the hypergraph corresponding to these dependencies is totally unimodular.

UR - https://www.scopus.com/pages/publications/1842592000

M3 - Paper

AN - SCOPUS:1842592000

SP - 568

EP - 569

T2 - Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 11 January 2004 through 13 January 2004

ER -

Non-independent Randomized Rounding

Abstract

Conference

Other files and links

Fingerprint

Cite this