Approximation algorithms for scheduling on multiple machines
暂无分享,去创建一个
Aravind Srinivasan | Madhav V. Marathe | V. S. Anil Kumar | Srinivasan Parthasarathy | S. Parthasarathy | A. Srinivasan | M. Marathe | V. S. A. Kumar
[1] Chak-Kuen Wong,et al. Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation , 1975, SIAM J. Comput..
[2] Richard M. Karp,et al. Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) , 1983, FOCS.
[3] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[4] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[5] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[6] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[7] B. Awerbuch,et al. Load Balancing in the Lp Norm , 1995, FOCS 1995.
[8] Ming-Yang Kao,et al. Load balancing in the L/sub p/ norm , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[9] Noga Alon,et al. Approximation schemes for scheduling , 1997, SODA '97.
[10] Clifford Stein,et al. On the existence of schedules that are near-optimal for both makespan and total weighted completion time , 1997, Oper. Res. Lett..
[11] Gerhard J. Woeginger,et al. Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .
[12] Clifford Stein,et al. Improved bicriteria existence theorems for scheduling , 2002, SODA '99.
[13] Martin Skutella,et al. Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.
[14] Yuval Rabani,et al. Fairness in routing and load balancing , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[15] Rajiv Gandhi,et al. Dependent rounding in bipartite graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[16] Y. Azar,et al. All-Norm Approximation for Scheduling on Identical Machines , 2004, SWAT.
[17] Gerhard J. Woeginger,et al. All-norm approximation algorithms , 2002, J. Algorithms.
[18] Aaron Archer,et al. Mechanisms for discrete optimization with rational agents , 2004 .
[19] Alexander Grigoriev,et al. Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times , 2005, IPCO.
[20] Yossi Azar,et al. Convex programming for scheduling unrelated parallel machines , 2005, STOC '05.
[21] Ashish Goel,et al. Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs , 2006, Algorithmica.