Sciweavers

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

14

ESA
1995
Springer

favoriteEmaildiscussreport

126views Algorithms» more ESA 1995»

The Online Transportation Problem

13 years 8 months ago

The Online Transportation Problem

Download www.cs.pitt.edu

We present a poly-log-competitive deterministic online algorithm for the online transportation problem on hierarchically separated trees when the online algorithm has one extra server per site. Using metric embedding results in the literature, one can then obtain a poly-log-competitive randomized online algorithm for the online transportation on an arbitrary metric space when the online algorithm has one extra server per site.

Bala Kalyanasundaram, Kirk Pruhs

Real-time Traffic

Algorithms | Deterministic Online Algorithm | ESA 1995 | Online Algorithm | Randomized Online Algorithm |

claim paper

Related Content

» Online DialARide Problem with Time Windows An Exact Algorithm Using Status Vectors

» Online SpatioTemporal Risk Assessment for Intelligent Transportation Systems

» HERO Online RealTime Vehicle Tracking in Shanghai

» TAUoverSupermon LowOverhead Online Parallel Performance Monitoring

» Online Coding for Reliable Data Transfer in Lossy Wireless Sensor Networks

» An Initial Task Assignment Method for Autonomous Distributed Vehicle Systems with Finite B...

» Recourse problem of the 2stage robust location transportation problem

» mediaBlocks Physical Containers Transports and Controls for Online Media

» A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	ESA
Authors	Bala Kalyanasundaram, Kirk Pruhs

Comments (0)