
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
41st Annual Symposium on Foundations of Computer Science
Approximating the single source unsplittable mincost flow problem
Redondo Beach, California
November 12November 14
ISBN: 0769508502
ASCII Text  x  
M. Skutella, "Approximating the single source unsplittable mincost flow problem," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 136, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892073, author = {M. Skutella}, title = {Approximating the single source unsplittable mincost flow problem}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {136}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892073}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Approximating the single source unsplittable mincost flow problem SN  02725428 SP EP A1  M. Skutella, PY  2000 KW  computational complexity; optimisation; processor scheduling; resource allocation; single source unsplittable mincost flow problem; common source vertex; destination vertices; edge capacities; NPcomplete problems; combinatorial optimization; packing; partitioning; load balancing; virtualcircuit routing; hard cost constraints; bicriteria approximations; hardness VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
In the single source unsplittable mincost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path and the total cost must not exceed a given budget. This problem has been introduced by J.M. Kleinberg (1996) and generalizes several NPcomplete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling load balancing, and virtualcircuit routing. S.G. Kolliopoulos and C. Stein (2000) and Y.N. Dinitz et al. (1999) developed algorithms improving the first approximation results of Kleinberg for the problem to minimize the violation of edge capacities and for other variants. However, none of the developed techniques is capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem.
Index Terms:
computational complexity; optimisation; processor scheduling; resource allocation; single source unsplittable mincost flow problem; common source vertex; destination vertices; edge capacities; NPcomplete problems; combinatorial optimization; packing; partitioning; load balancing; virtualcircuit routing; hard cost constraints; bicriteria approximations; hardness
Citation:
M. Skutella, "Approximating the single source unsplittable mincost flow problem," focs, pp.136, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.