TY - JOUR
T1 - Dependent rounding in bipartite graphs
AU - Gandhi, Rajiv
AU - Khuller, Samir
AU - Parthasarathy, Srinivasan
AU - Srinivasan, Aravind
N1 - Copyright:
Copyright 2004 Elsevier Science B.V., Amsterdam. All rights reserved.
PY - 2002
Y1 - 2002
N2 - The pipage rounding technique of Ageev & Sviridenko is combined with the recent rounding method developed by Srinivasan. The aim is to develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. A useful feature of the method is that it allows to prove certain (probabilistic) per-user fairness properties.
AB - The pipage rounding technique of Ageev & Sviridenko is combined with the recent rounding method developed by Srinivasan. The aim is to develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. A useful feature of the method is that it allows to prove certain (probabilistic) per-user fairness properties.
UR - http://www.scopus.com/inward/record.url?scp=0036957909&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0036957909&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:0036957909
SN - 0272-5428
SP - 323
EP - 332
JO - Annual Symposium on Foundations of Computer Science - Proceedings
JF - Annual Symposium on Foundations of Computer Science - Proceedings
T2 - The 34rd Annual IEEE Symposium on Foundations of Computer Science
Y2 - 16 November 2002 through 19 November 2002
ER -