Author:
Sun Jian,Xu Dachuan,Ma Ran,Zhang Xiaoyan
Publisher
Springer International Publishing
Reference12 articles.
1. Afrati, F., Bampis, E., Chekuri, C., Karger, D. et al.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 32–43 (1999)
2. Andersson, G.: An approximation algorithm for max
$$p$$
-section. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 237–247
3. Bansal, N., Srinivasan, A., Svensson, O.: Lift-and-round to improve weighted completion time on unrelated machines. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing, pp. 156–167 (2016)
4. Chekuri, C., Khanna, S.: A PTAS for minimizing weighted completion time on uniformly related machines. In: Proceedings of 28th International Colloquium on Automata, Languages, and Programming, pp. 848–861. Springer, Berlin (2001)
5. Goemans, M.X., Williamson, D.P.: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. J. Comput. Syst Sci. 68, 442–470 (2004)