Construct · 1 fields · 1 citations

online bipartite matching: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
online bipartitematching1 CONSTRUCTOnline bipartiteKARP · ONLINE ALGORITHMS

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Online algorithms

the problem of irrevocably matching vertices that arrive one at a time, where a randomized ranking achieves the optimal 1 - 1/e competitive ratio.

In online algorithms, online bipartite matching refers to the problem of irrevocably matching vertices that arrive one at a time, where a randomized ranking achieves the optimal 1 - 1/e competitive ratio. This meaning comes from Karp (1990) in Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how online bipartite matching sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

competitive analysis1 fields · 1 citationsanchor · a standalone constructfilter bubble1 fields · 3 citationsanchor · a standalone constructmatching4 fields · 4 citationsjingle · one word, four constructs

References

  1. Karp, R. M., Vazirani, U. V., & Vazirani, V. V. (1990). An optimal algorithm for on-line bipartite matching. Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90. https://doi.org/10.1145/100216.100262

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct