On-line algorithms for weighted bipartite matching and stable marriages

Theoretical Computer Science

Volumn 127, Issue 2, 1994, Pages 255-267

  Khuller, Samir ^a   Mitchell, Stephen G ^b   Vazirani, Vijay V ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b Department of Electrical Engineering Cornell University ^*  (United States)

^c INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ONLINE SYSTEMS; RANDOM PROCESSES;

BIPARTITE MATCHING; DETERMINISTIC ALGORITHMS;

ALGORITHMS;

EID: 0028425278     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)90042-6     Document Type: Article

References (9)

1. On-line weighted matching
2. An optimal algorithm for on-line bipartite matching
3. Competitive algorithms for server problems
4. Shortest paths without a map
5. Amortized efficiency of list update and paging rules
6. Probabilistic computations: towards a unified measure of complexity
7. The roommate problem: On-line matching and general graphs