Dependent rounding and its applications to approximation algorithms

Abstract

We develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to improved (approximation) algorithms for various problems. These include:---low congestion multi-path routing;---richer random-graph models for graphs with a given… (More)
DOI: 10.1145/1147954.1147956

Topics

4 Figures and Tables

Statistics

01020'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

179 Citations

Semantic Scholar estimates that this publication has 179 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics