Generating Randomized Roundings with Cardinality Constraints and Derandomizations

We provide a general method to generate randomized roundings that satisfy cardinality constraints. Our approach is different from the one taken by Srinivasan (FOCS 2001) and Gandhi et al. (FOCS 2002) for one global constraint and the bipartite edge weight rounding problem. Also for these special cases, our approach is the first that can be derandomized. For the bipartite edge weight rounding problem, in addition, we gain an $\tilde{O}(|V|)$ factor run-time improvement for generating the randomized solution. We also improve the current best result on the general problem of derandomizing randomized roundings. Here we obtain a simple O(mnlog n) time algorithm that works in the RAM model for arbitrary matrices with entries in ℚ≥0. This improves over the O(mn2 log(mn)) time solution of Srivastav and Stangier.

[1]  Rajiv Gandhi,et al.  An improved approximation algorithm for vertex cover with hard capacities , 2006, J. Comput. Syst. Sci..

[2]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[3]  Benjamin Doerr.  Nonindependent Randomized Rounding and an Application to Digital Halftoning , 2004, SIAM J. Comput..

[4]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[5]  Aravind Srinivasan,et al.  Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[6]  Tetsuo Asano,et al.  Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning , 2002, SODA '02.

[7]  Benjamin Doerr.  Non-independent randomized rounding , 2003, SODA '03.

[8]  Maxim Sviridenko,et al.  Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..

[9]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[10]  Benjamin Doerr.  Roundings Respecting Hard Constraints , 2006, Theory of Computing Systems.

[11]  Peter Stangier,et al.  Algorithmic Chernoff-Hoeffding inequalities in integer programming , 1996, Random Struct. Algorithms.

[12]  Rajiv Gandhi,et al.  Dependent rounding in bipartite graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[13]  Joel H. Spencer,et al.  Integral approximation sequences , 1984, Math. Program..

[14]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[15]  Benjamin Doerr.  Roundings Respecting Hard Constraints , 2005, STACS.

[16]  Prabhakar Raghavan,et al.  Multiterminal global routing: A deterministic approximation scheme , 2005, Algorithmica.

[17]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[18]  Kunihiko Sadakane,et al.  Combinatorics and algorithms for low-discrepancy roundings of a real sequence , 2005, Theor. Comput. Sci..

[19]  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.