Publication | Closed Access
On-line bipartite matching made simple
159
Citations
9
References
2008
Year
Mathematical ProgrammingRanking AlgorithmEngineeringGraph TheorySocial MatchingMatching TechniqueOn-line BipartiteCombinatorial ProblemSimple ProofGraph MatchingComputer ScienceDiscrete MathematicsCombinatorial OptimizationComputational GeometryCompetitive Ratio
We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for this problem achieves a competitive ratio of 1 -- 1/ e .
| Year | Citations | |
|---|---|---|
Page 1
Page 1