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 O(log
2
n) Replacements
Aaron Bernstein,
Jacob Holm
, Eva Rotenberg
3
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Online Bipartite Matching with Amortized O(log
2
n) Replacements'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Online Bipartite Matching
100%
Server Load
100%
Number of Vertices
100%
Bipartition
100%
Capacitated
50%
Assignment Problem
50%
Maximum Matching
50%
Shortest Augmenting Path
50%
Greedy Algorithm
50%
Good Strategies
50%
Matching Problem
50%
Replacement Strategy
50%
Tight
50%
Incident Edges
50%
Computer Science
bipartite matching
100%
Greedy Algorithm
50%
Maximum Matching
50%
Assignment Problem
50%
Augmenting Path
50%