Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds-Reference-Cited by-同舟云学术

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds

Published:2014 Issue: Volume: Page:47-59
ISSN:0302-9743
Container-title:LATIN 2014: Theoretical Informatics
language:
Short-container-title:

Author:

Bansal Nikhil,Vredeveld Tjark,van der Zwaan Ruben

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-54423-1_5

Reference18 articles.

1. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling 1, 55–66 (1998)

2. Bonifaci, V., Wiese, A.: Scheduling unrelated machines of few different types. CoRR, abs/1205.0974 (2012)

3. Calabro, C., Impagliazzo, R., Paturi, R.: A duality between clause width and clause density for SAT. In: IEEE Conference on Computational Complexity, pp. 252–260. IEEE Computer Society (2006)

4. Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Comput. 33(4), 837–851 (2004)

5. Eisenbrand, F., Shmonin, G.: Carathéodory bounds for integer cones. Oper. Res. Lett. 34(5), 564–568 (2006)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds;Algorithmica;2016-01-19

2. Vector Scheduling Problems;Encyclopedia of Algorithms;2016

3. Approximation Schemes for Robust Makespan Scheduling Problems;Operations Research Proceedings;2016

4. Min-heap-based scheduling algorithm: an approximation algorithm for homogeneous and heterogeneous distributed systems;International Journal of Parallel, Emergent and Distributed Systems;2015-02-19

5. Approximating Real-Time Scheduling on Identical Machines;LATIN 2014: Theoretical Informatics;2014