SIGN IN
SIGN UP
Hiring a secretary from a poset
Full Text:
PDF
Buy this Article
Authors:
Ravi Kumar
Yahoo! Research, Santa Clara, CA, USA
Silvio Lattanzi
Google Inc., New York, NY, USA
Sergei Vassilvitskii
Yahoo! Research, New York, NY, USA
Andrea Vattani
UC San Diego, San Diego, CA, USA
2011 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 27
· Downloads (cumulative): 87
· Citation Count: 1
Published in:
· Proceeding
EC '11
Proceedings of the 12th ACM conference on Electronic commerce
Pages 39-48
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0261-6
doi>
10.1145/1993574.1993582
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
EC '13
Share:
|
Tags:
algorithms
computations on discrete structures
partial order
secretary problem
theory
Feedback
|
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
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder