Improved Algorithms for Scheduling Unsplittable Flows on Paths

ISAAC, 2017.

Cited by: 0|Bibtex|Views22
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

In this paper, we investigate offline and online algorithms for rufpp, the problem of minimizing the number of rounds required to schedule a set of unsplittable flows of non-uniform sizes on a given path with non-uniform edge capacities. rufpp is NP-hard and constant-factor approximation algorithms are known under the no bottleneck assump...More

Code:

Data:

Your rating :
0

 

Tags
Comments