SIGN IN
SIGN UP
Dial a Ride from
k
-forest
Full Text:
PDF
Buy this Article
Authors:
Anupam Gupta
Carnegie Mellon University, Pittsburgh, PA
Mohammadtaghi Hajiaghayi
AT&T Research Labs, Florham Park, NJ
Viswanath Nagarajan
IBM T.J. Watson Research Center, Yorktown Heights, NY
R. Ravi
Carnegie Mellon University, Pittsburgh, PA
2010 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 57
· Downloads (cumulative): 214
· Citation Count: 1
Published in:
· Journal
ACM Transactions on Algorithms (TALG)
TALG Homepage
archive
Volume 6 Issue 2, March 2010
Article No. 41
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1721837.1721857
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
approximation algorithms
network design
nonnumerical algorithms and problems
theory
vehicle routing
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