3016 search results - page 63 / 604 » The Online Transportation Problem |
SIAMDM
1998
13 years 9 months ago
1998
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
STOC
1991
ACM
14 years 1 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
DFG
2009
Springer
14 years 4 months ago
2009
Springer
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s...
AINA
2004
IEEE
14 years 1 months ago
2004
IEEE
The interconnection of software components is a key to enabling collaborative work. However, technology differences and security barriers like firewalls often hinder establishing ...
SIAMMA
2011
13 years 5 months ago
2011
In this paper, we introduce a notion of barycenter in the Wasserstein space which generalizes McCann’s interpolation to the case of more than two measures. We provide existence,...