Dependent Randomized Rounding: The Bipartite Case
暂无分享,去创建一个
[1] Joseph Naor,et al. Approximating the average response time in broadcast scheduling , 2005, SODA '05.
[2] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[3] Maxim Sviridenko,et al. Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts , 1999, IPCO.
[4] Rajiv Gandhi,et al. Dependent rounding in bipartite graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[5] Magnus Wahlström,et al. Randomized Rounding in the Presence of a Cardinality Constraint , 2009, ALENEX.
[6] Juraj Hromkovič. Design and Analysis of Randomized Algorithms , 2005 .
[7] Aravind Srinivasan,et al. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..
[8] Magnus Wahlström,et al. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements , 2010, SEA.
[9] J. Hromkovic,et al. Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series) , 2005 .
[10] Aravind Srinivasan,et al. Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[11] Benjamin Moseley,et al. An online scalable algorithm for average flow time in broadcast scheduling , 2010, SODA '10.
[12] Benjamin Doerr. Roundings Respecting Hard Constraints , 2005, STACS.
[13] Aravind Srinivasan,et al. Improved Approximation Algorithms for the Partial Vertex Cover Problem , 2002, APPROX.
[14] Nikhil Bansal,et al. Improved approximation algorithms for broadcast scheduling , 2006, SODA '06.
[15] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[16] Maxim Sviridenko,et al. An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts , 1999, ESA.
[17] Benjamin Doerr. Non-independent randomized rounding , 2003, SODA '03.
[18] Benjamin Doerr,et al. Non-independent Randomized Rounding and an Application to Digital Halftoning , 2002, ESA.
[19] Benjamin Doerr. Nonindependent Randomized Rounding and an Application to Digital Halftoning , 2004, SIAM J. Comput..
[20] Benjamin Doerr. Generating Randomized Roundings with Cardinality Constraints and Derandomizations , 2006, STACS.
[21] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[22] Samir Khuller,et al. Broadcast scheduling: Algorithms and complexity , 2008, TALG.
[23] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..