Semi-matchings for bipartite graphs and load balancing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2748, Issue , 2003, Pages 294-306

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

^a MICROSOFT RESEARCH   (United States)

^b University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY; NETWORK MANAGEMENT; OPTIMIZATION;

BEST-KNOWN ALGORITHMS; BIPARTITE GRAPHS; BIPARTITE MATCHING PROBLEMS; BIPARTITE MATCHINGS; GENERAL NETWORKS; HUNGARIAN METHOD; NETWORK OPTIMIZATION; SCHEDULING PROBLEM;

ALGORITHMS;

EID: 35248857473     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_26     Document Type: Article

References (16)

1. Active Directory. http://www.microsoft.com/windowsserver2003/technologies.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
3. p Norm. In Proceedings of FOCS, 1995.
4. Y. Azar. On-line Load Balancing. In A. Fiat and G. Woeginger, editors, Online Algorithms: The State of the Art (LNCS 1442), chapter 8. Springer-Verlag, 1998.
5. Y. Azar, A. Z. Broder, and A. R. Karlin. On-line load balancing. Theoretical Computer Science, 130(1):73-84, 1994.
6. Y. Azar, J. Naor, and R. Rom. The Competitiveness of On-line Assignments. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 1992.
7. J. L. Bruno, E. G. Coffman, and R. Sethi. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17:382-387, 1974.
8. B. V. Cherkassky, A. V. Goldberg, P. Martin, J. C. Setubal, and J. Stolfi. Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms. ACM J. Exp. Algorithmics, 3(8), 1998. Source code available at http://www.avglab.com/andrew/soft.html.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, second edition, 2001.
10. A. Goldberg and R. Kennedy. An efficient cost scaling algorithm for the assignment problem. Math. Prog., 71:153-178, 1995. Source code available at http://www.avglab.com/andrew/soft.html.
11. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math, 5:287-326, 1979.
12. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Computing, 2:225-231, 1973.
13. W. A. Horn. Minimizing average flow time with parallel machines. Operations Research, 21:846-847, 1973.
14. H. W. Kuhn. The Hungarian method for the assignment problem. Naval Res. Logist. Quart., 2:83-97, 1955.
15. E. Lawler. Combinatorial Optimization: Networks and Matroids. Dover, 2001.
16. LEDA. http://www.algorithmic-solutions.com/.