SIGN IN
SIGN UP
Catch them if you can: how to serve impatient users
Full Text:
PDF
Buy this Article
Authors:
Marek Cygan
University of Warsaw, Warszawa, Poland
Matthias Englert
University of Warwick, Coventry, United Kingdom
Anupam Gupta
Carnegie Mellon University, Pittsburgh, PA, USA
Marcin Mucha
University of Warsaw, Warszawa, Poland
Piotr Sankowski
University of Warsaw, Warszawa, Poland
2013 Article
Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 29
· Downloads (cumulative): 29
· Citation Count: 0
Published in:
· Proceeding
ITCS '13
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Pages 485-494
ACM
New York, NY
, USA
©2013
table of contents
ISBN: 978-1-4503-1859-4
doi>
10.1145/2422436.2422489
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
bipartite matching
graph algorithms
impatience
nonnumerical algorithms and problems
online algorithms
stochastic models
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