Online matching with blocked input
From MaRDI portal
Publication:1178205
DOI10.1016/0020-0190(91)90231-6zbMath0739.68044OpenAlexW2004533347MaRDI QIDQ1178205
Ming-Yang Kao, Stephen R. Tate
Publication date: 26 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://libres.uncg.edu/ir/uncg/f/S_Tate_Online_1991.pdf
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (5)
Lower bounds for on-line graph coloring ⋮ Online total bipartite matching problem ⋮ A competitive analysis of the list update problem with lookahead ⋮ A Competitive analysis of the list update problem with lookahead ⋮ An optimal deterministic algorithm for online \(b\)-matching
Cites Work
This page was built for publication: Online matching with blocked input
