A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
暂无分享,去创建一个
[1] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[2] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[3] Steef L. van de Velde. Duality-Based Algorithms for Scheduling Unrelated Parallel Machines , 1993, INFORMS J. Comput..
[4] Tomasz Radzik. Improving time bounds on maximum generalised flow computations by contracting the network , 2004, Theor. Comput. Sci..
[5] Francis Sourd. Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures , 2001, J. Heuristics.
[6] Jon M. Kleinberg,et al. Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[7] Klaus Jansen,et al. Improved Approximation Schemes for Scheduling Unrelated Parallel Machines , 2001, Math. Oper. Res..
[8] Andrew V. Goldberg,et al. Combinatorial Algorithms for the Generalized Circulation Problem , 1991, Math. Oper. Res..
[9] Michel Minoux,et al. Graphs and Algorithms , 1984 .
[10] K. Onaga. Dynamic Programming of Optimum Flows in Lossy Communication Nets , 1966 .
[11] Michel X. Goemans,et al. On the Single-Source Unsplittable Flow Problem , 1999, Comb..
[12] Mark A. Fuller,et al. Faster Algorithms for the Generalized Network Flow Problem , 1998 .
[13] Clifford Stein,et al. Approximation Algorithms for Single-Source Unsplittable Flow , 2001, SIAM J. Comput..
[14] Marios Mavronicolas,et al. Computing Nash Equilibria for Scheduling on Restricted Parallel Links , 2004, STOC '04.
[15] Éva Tardos,et al. Simple Generalized Maximum Flow Algorithms , 1998, IPCO.
[16] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[17] James B. Orlin,et al. Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem , 1997, Math. Oper. Res..
[18] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[19] William S. Jewell. New Methods in Mathematical Programming---Optimal Flow Through Networks with Gains , 1962 .
[20] Lisa Fleischer,et al. Fast and simple approximation schemes for generalized flow , 2002, Math. Program..
[21] K. Truemper. On Max Flows with Gains and Pure Min-Cost Flows , 1977 .
[22] Ellis Horowitz,et al. Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.
[23] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[24] Pravin M. Vaidya,et al. Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[25] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..
[26] Pravin M. Vaidya,et al. Fast algorithms for convex quadratic programming and multicommodity flows , 1986, STOC '86.
[27] Philippe Chrétienne,et al. A cutting plane algorithm for the unrelated parallel machine scheduling problem , 2002, Eur. J. Oper. Res..
[28] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[29] Nodari Vakhania,et al. An optimal rounding gives a better approximation for scheduling unrelated machines , 2005, Oper. Res. Lett..