Roundings Respecting Hard Constraints
暂无分享,去创建一个
[1] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[2] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 2002, Math. Program..
[3] József Beck,et al. "Integer-making" theorems , 1981, Discret. Appl. Math..
[4] Aravind Srinivasan,et al. Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[5] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[6] Prabhakar Raghavan,et al. Multiterminal global routing: A deterministic approximation scheme , 2005, Algorithmica.
[7] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[8] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.
[9] J. Spencer. Ten lectures on the probabilistic method , 1987 .
[10] A. Srivastav,et al. Algorithmic Chernoff-Hoeffding inequalities in integer programming , 1996 .
[11] Richard M. Karp,et al. Global wire routing in two-dimensional arrays , 1987, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[12] Aravind Srinivasan,et al. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..
[13] Anand Srivastav,et al. Multicolour Discrepancies , 2003, Comb. Probab. Comput..
[14] Rajiv Gandhi,et al. Dependent rounding in bipartite graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[15] Benjamin Doerr,et al. Lattice approximation and linear discrepency of totally unimodular matrices , 2001, SODA '01.
[16] D. de Werra. Equitable colorations of graphs , 1971 .