Randomized rounding: A technique for provably good algorithms and algorithmic proofs
暂无分享,去创建一个
[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[2] W. Hoeffding. On the Distribution of the Number of Successes in Independent Trials , 1956 .
[3] Alon Itai,et al. On the complexity of time table and multi-commodity flow problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[4] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[5] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..
[6] S. N. Maheshwari,et al. An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..
[7] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[8] Zoltán Füredi,et al. Maximum degree and fractional matchings in uniform hypergraphs , 1981, Comb..
[9] Richard M. Karp,et al. Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) , 1983, FOCS.
[10] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[11] Paul Erdös,et al. Dual integer linear programs and the relationship between their optima , 1985, STOC '85.
[12] Prabhakar Raghavan,et al. Provably good routing in graphs: regular arrays , 1985, STOC '85.
[13] Man-Tak Shing,et al. A decomposition algorithm for circuit routing , 1985 .