Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

118

Voted

SODA
2012
ACM

224views Algorithms» more SODA 2012»

Algorithms for the transportation problem in geometric settings

13 years 5 months ago

Algorithms for the transportation problem in geometric settings

Download web.eecs.umich.edu

R. Sharathkumar, Pankaj K. Agarwal

Real-time Traffic

Algorithms | SODA 2012 |

claim paper

Related Content

» Solving Geometric Covering Problems by Data Reduction

» Improved Results on Geometric Hitting Set Problems

» Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems

» PTAS for geometric hitting set problems via local search

» TimeSeries Similarity Problems and WellSeparated Geometric Sets

» Metropolis light transport

» Optimal location of transportation devices

» A BranchandCut Algorithm for the DialaRide Problem

» Geometric Set Cover and Hitting Sets for Polytopes in R3

Post Info
More Details (n/a)

Added	28 Sep 2012
Updated	28 Sep 2012
Type	Journal
Year	2012
Where	SODA
Authors	R. Sharathkumar, Pankaj K. Agarwal

Comments (0)