Back to Results
First PageMeta Content
Matching / Combinatorics / NP-complete problems / Combinatorial optimization / Spanning tree / Stable marriage problem / Approximation algorithm / 3-dimensional matching / Minimum spanning tree


Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar
Add to Reading List

Document Date: 2015-12-01 10:37:13


Open Document

File Size: 227,63 KB

Share Result on Facebook