Journal of Algorithms
On-line algorithms for weighted bipartite matching and stable marriages
Theoretical Computer Science
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The Online Transportation Problem
SIAM Journal on Discrete Mathematics
Algorithms for Network Programming
Algorithms for Network Programming
On-line Network Optimization Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Randomized online algorithms for minimum metric bipartite matching
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A randomized algorithm for the on-line weighted bipartite matching problem
Journal of Scheduling
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
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.