Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Online Bipartite Matching with Amortized Replacements
Aaron Bernstein,
Jacob Holm
, Eva Rotenberg
11
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Online Bipartite Matching with Amortized Replacements'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Assignment Problem
13%
Bipartite Matching
100%
Graph in graph theory
5%
Greedy Algorithm
12%
Immediately
11%
Imply
7%
Insertion
12%
Lower bound
7%
Matching Problem
12%
Maximum Matching
14%
Necessary
7%
Replacement
69%
Server
24%
Shortest path
12%
Strategy
16%
Trivial
9%
Upper bound
7%
Vertex of a graph
13%