Randomized Rounding in the Presence of a Cardinality Constraint
暂无分享,去创建一个
[1] Benjamin Doerr. Randomly Rounding Rationals with Cardinality Constraints and Derandomizations , 2007, STACS.
[2] Benjamin Doerr,et al. Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding , 2008 .
[3] Maxim Sviridenko,et al. An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts , 1999, ESA.
[4] Aravind Srinivasan,et al. Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[5] A. P. C. Ng,et al. Experimental results for a linear program global router , 1987 .
[6] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[7] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[8] Daniel L. Lau,et al. Modern Digital Halftoning , 2001 .
[9] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 2002, Math. Program..
[10] Rajiv Gandhi,et al. An improved approximation algorithm for vertex cover with hard capacities , 2003, J. Comput. Syst. Sci..
[11] Juraj Hromkovic. Design and Analysis of Randomized Algorithms - Introduction to Design Paradigms , 2005, Texts in Theoretical Computer Science. An EATCS Series.
[12] Rajiv Gandhi,et al. Dependent rounding in bipartite graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[13] Joseph Naor,et al. Covering Problems with Hard Capacities , 2006, SIAM J. Comput..
[14] Maxim Sviridenko,et al. Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts , 1999, IPCO.
[15] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[16] Benjamin Doerr. Roundings Respecting Hard Constraints , 2005, STACS.
[17] Prabhakar Raghavan,et al. Multiterminal global routing: A deterministic approximation scheme , 2005, Algorithmica.
[18] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[19] Tetsuo Asano,et al. Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning , 2002, SODA '02.
[20] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..
[21] Benjamin Doerr. Generating Randomized Roundings with Cardinality Constraints and Derandomizations , 2006, STACS.
[22] B. Causey,et al. Applications of Transportation Theory to Statistical Problems , 1985 .
[23] Prabhakar Raghavan. Randomized Approximation Algorithms in Combinatorial Optimization , 1994, FSTTCS.
[24] Benjamin Doerr. Nonindependent Randomized Rounding and an Application to Digital Halftoning , 2004, SIAM J. Comput..