An optimal deterministic algorithm for online b-matching
Authors:
- Bala KalyanasundaramBKBala Kalyanasundaram
- Kirk R. PruhsKPKirk R. Pruhs
- 1 February 2000
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 233 (1-2) , 319-325
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The online transportation problemLecture Notes in Computer Science, 1995
- Online perfect matching and mobile computing1995
- On-line algorithms for weighted bipartite matching and stable marriagesTheoretical Computer Science, 1994
- Online Weighted MatchingJournal of Algorithms, 1993
- Online matching with blocked inputInformation Processing Letters, 1991
- An optimal algorithm for on-line bipartite matching1990
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985