SIGN IN
SIGN UP
Online bipartite matching with unknown distributions
Full Text:
PDF
SIGN IN to get this Article
see
source materials
below for
more options
Authors:
Chinmay Karande
Google Research, Mountain View, CA, USA
Aranyak Mehta
Google Research, Mountain View, CA, USA
Pushkar Tripathi
Georgia Inst. of Technology, Atlanta, GA, USA
Published in:
· Proceeding
STOC '11
Proceedings of the forty-third annual ACM symposium on Theory of computing
Pages 587-596
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0691-1
doi>
10.1145/1993636.1993715
2011 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 35
· Downloads (cumulative): 540
· Citation Count: 36
Tools and Resources
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC '17
Share:
|
Author Tags
algorithms
bipartite matching
matching
online algorithms
online matching
randomized algorithms
randomness, geometry and discrete structures
Contact Us
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder