Im, S., Kulkarni, J., Moseley, B., & Munagala, K. (2016). A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints. In APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES, APPROX/RANDOM 2016 (Vol. 60). https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.10

Im, Sungjin, Janardhan Kulkarni, Benjamin Moseley, and Kamesh Munagala. “A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints.” In APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES, APPROX/RANDOM 2016, Vol. 60, 2016. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.10.

Im S, Kulkarni J, Moseley B, Munagala K. A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints. In: APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION ALGORITHMS AND TECHNIQUES, APPROX/RANDOM 2016. 2016.

Im, Sungjin, et al. “A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints.” APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES, APPROX/RANDOM 2016, vol. 60, 2016. Wos-lite, doi:10.4230/LIPIcs.APPROX-RANDOM.2016.10.

Im S, Kulkarni J, Moseley B, Munagala K. A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION ALGORITHMS AND TECHNIQUES, APPROX/RANDOM 2016. 2016.