3016 search results - page 12 / 604 » The Online Transportation Problem |
SWAT
1994
Springer
13 years 11 months ago
1994
Springer
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
TCS
2008
13 years 7 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
INFOCOM
1994
IEEE
13 years 11 months ago
1994
IEEE
This pape? presents a novel approach to dynamic transmission bandwidth allocation for transport of real-time variable-bit-rate video in ATM networks. Describe video traffic in the...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...