Approximating low-congestion routing and column-restricted packing problems
- 1 April 2000
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 74 (1-2) , 19-25
- https://doi.org/10.1016/s0020-0190(00)00033-8
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Approximation Algorithms for Disjoint Paths and Related Routing and Packing ProblemsMathematics of Operations Research, 2000
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963