Stochastic Matching with Commitment
- 1 January 2012
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 822-833
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Improved analysis of the greedy algorithm for stochastic matchingInformation Processing Letters, 2011
- Finding a maximum matching in a sparse random graph in O ( n ) expected timeJournal of the ACM, 2010
- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings2010
- Approximating Matches Made in Heaven2009
- On-line bipartite matching made simpleACM SIGACT News, 2008
- Stochastic Shortest Paths Via Quasi-convex Maximization2006
- Maximum matchings in sparse random graphs: Karp–Sipser revisitedRandom Structures & Algorithms, 1998
- Randomized greedy matching. IIRandom Structures & Algorithms, 1995
- Shortest paths without a mapTheoretical Computer Science, 1991
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965