A Simple Analysis of Ranking in General Graphs
By: Mahsa Derakhshan , Mohammad Roghani , Mohammad Saneian and more
Potential Business Impact:
Finds good matches in complicated groups.
We provide a simple combinatorial analysis of the Ranking algorithm, originally introduced in the seminal work by Karp, Vazirani, and Vazirani [KVV90], demonstrating that it achieves a $(1/2 + c)$-approximate matching for general graphs for $c \geq 0.005$.
Similar Papers
Improved Approximation for Ranking on General Graphs
Data Structures and Algorithms
Helps computers find better pairings for things.
Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis
Data Structures and Algorithms
Helps computers match jobs to people better.
Sorting with constraints
Data Structures and Algorithms
Sorts items when not all comparisons are allowed.