All-norm approximation algorithms
- 10 April 2004
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 52 (2), 120-133
- https://doi.org/10.1016/j.jalgor.2004.02.003
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fairness in Routing and Load BalancingJournal of Computer and System Sciences, 2001
- On the existence of schedules that are near-optimal for both makespan and total weighted completion timeOperations Research Letters, 1997
- Least Majorized Elements and Generalized PolymatroidsMathematics of Operations Research, 1995
- An approximation algorithm for the generalized assignment problemMathematical Programming, 1993
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation ApproachSIAM Journal on Computing, 1988
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- A good algorithm for lexicographically optimal flows in multi-terminal networksBulletin of the American Mathematical Society, 1977
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Optimal flows in networks with multiple sources and sinksMathematical Programming, 1974