Semi-matchings for bipartite graphs and load balancing

Journal of Algorithms

Volumn 59, Issue 1, 2006, Pages 53-78

  Harvey, Nicholas J A ^a   Ladner, Richard E ^b   Lovász, László ^c   Tamir, Tami ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b University of Washington   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Bipartite graphs; Load balancing; Matching algorithms; Optimal algorithms; Semi matching

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; JOB ANALYSIS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; QUEUEING THEORY; SCHEDULING;

BIPARTITE GRAPHS; LOAD BALANCING; MATCHING ALGORITHMS; OPTIMAL ALGORITHMS; SEMI-MATCHING;

GRAPH THEORY;

EID: 33646449320     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2005.01.003     Document Type: Article

References (18)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms, and Applications (1993), Prentice Hall
2. Cherkassky B.V., Goldberg A.V., Martin P., Setubal J.C., and Stolfi J. Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms. ACM J. Exp. Algorithms 3 8 (1998). http://www.avglab.com/andrew/soft.html Source code available at
3. 5 / 2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2 (1973) 225-231
4. Kuhn H.W. The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2 (1955) 83-97
5. Lawler E. Combinatorial Optimization: Networks and Matroids (2001), Dover
6. Azar Y. On-line load balancing. In: Fiat A., and Woeginger G. (Eds). Online Algorithms: The State of the Art. Lecture Notes in Comput. Sci. vol. 1442 (1998), Springer-Verlag, Berlin Chapter 8
7. Active Directory. http://www.microsoft.com/windowsserver2003/technologies
8. Horn W.A. Minimizing average flow time with parallel machines. Oper. Res. 21 (1973) 846-847
9. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. 2nd ed. (2001), MIT Press
10. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5 (1979) 287-326
11. Bruno J.L., Coffman E.G., and Sethi R. Scheduling independent tasks to reduce mean finishing time. Comm. ACM 17 (1974) 382-387
12. p norm. Proceedings of the IEEE Symposium on Foundations of Computer Science (1995), IEEE
13. Azar Y., Broder A.Z., and Karlin A.R. On-line load balancing. Theoret. Comput. Sci. 130 1 (1994) 73-84
14. Azar Y., Naor J., and Rom R. The competitiveness of on-line assignments. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (1992), ACM
15. D. Abraham, Algorithmics of two-sided matching problems, Master's thesis, Department of Computing Science, University of Glasgow, 2003
16. Rudin W. Principles of Mathematical Analysis. 3rd ed. (1976), McGraw-Hill
17. Goldberg A., and Kennedy R. An efficient cost scaling algorithm for the assignment problem. Math. Program. 71 (1995) 153-178. http://www.avglab.com/andrew/soft.html Source code available at
18. Melhorn K., and Näher S. LEDA: a platform for combinatorial and geometric computing (1999), Cambridge University Press