Back to Results
First PageMeta Content
Combinatorial optimization / Matching / Randomized algorithm / Rank / Matrix / Hungarian algorithm / Disjunct matrix / Mathematics / Theoretical computer science / Algebra


An Optimal Algorithm for On-line Bipartite Matching Richard M. Karp University of California at Berkeley & International Computer Science Institute Umesh V. Vazirani University of California at Berkeley
Add to Reading List

Document Date: 2004-09-11 21:06:21


Open Document

File Size: 545,96 KB

Share Result on Facebook

City

L.A. / /

Company

RANKING / RANDOM / /

Currency

USD / cent / /

Event

Person Communication and Meetings / /

Facility

Bipartite Matching Richard M. Karp University of California at Berkeley / Vazirani University of California at Berkeley Vijay V. Vazirani Cornell University / /

IndustryTerm

non-greedy randomized algorithm / on-line algorithms / refusal algorithm / deterministic on-line algorithm / detern ministic algorithm / on-line matching algorithm / off-line algorithm / given randomized on-line algorithm / greedy algorithm / randomized on-line algorithm / randomized on-line algorithms / upper-triangular matrix algorithm / deterministic algorithm / on-line algorithm / possible off-line algorithm / adaptive on-line adversary / on-line and off-line algorithms / /

Organization

University of California / Cornell University / Association for Computing Machinery / /

Person

Rajeev Motwani / Vijay V. Vazirani / /

ProvinceOrState

California / /

Technology

randomized on-line algorithms / off-line algorithm / on-line and off-line algorithms / randomized algorithm / t-1 / on-line algorithms / on-line matching algorithm / possible off-line algorithm / deterministic on-line algorithm / deterministic algorithm / greedy algorithm / on-line algorithm / detern ministic algorithm / Paging / non-greedy randomized algorithm / upper-triangular matrix algorithm / randomized on-line algorithm / t - 1 / refusal algorithm / given randomized on-line algorithm / /

SocialTag