Semi-matchings for bipartite graphs and load balancing
Authors:
- 1 April 2006
- journal article
- research article
- Published by Elsevier in Journal of Algorithms
- Vol. 59 (1) , 53-78
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An efficient cost scaling algorithm for the assignment problemMathematical Programming, 1995
- On-line load balancingTheoretical Computer Science, 1994
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Technical Note—Minimizing Average Flow Time with Parallel MachinesOperations Research, 1973
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955