Fast Approximation Algorithms for Fractional Packing and Covering Problems
暂无分享,去创建一个
[1] Kurt Eisemann,et al. The Trim Problem , 1957 .
[2] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[3] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[4] Richard M. Karp,et al. An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[5] Martin Dyer,et al. AN O(n) ALGORITHM FOR THE MULTIPLE-CHOICE , 2007 .
[6] Pravin M. Vaidya,et al. Fast algorithms for convex quadratic programming and multicommodity flows , 1986, STOC '86.
[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] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[9] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[10] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[11] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[12] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1989, 30th Annual Symposium on Foundations of Computer Science.
[13] Pravin M. Vaidya,et al. Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[14] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[15] Fillia Makedon,et al. Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.
[16] David B. Shmoys,et al. Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.
[17] Richard M. Karp,et al. Probabilistic recurrence relations , 1994, JACM.
[18] Andrew V. Goldberg. A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms , 1992, Inf. Process. Lett..