The Online Transportation Problem
From MaRDI portal
Publication:4490792
DOI10.1137/S0895480198342310zbMath0949.68119OpenAlexW1999361850MaRDI QIDQ4490792
Bala Kalyanasundaram, Kirk R. Pruhs
Publication date: 20 July 2000
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480198342310
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Transversal (matching) theory (05D15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (14)
A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line ⋮ Online bottleneck semi-matching ⋮ Serve or skip: the power of rejection in online bottleneck matching ⋮ A \(o(n)\)-competitive deterministic algorithm for online matching on a line ⋮ Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm ⋮ Online bottleneck matching on a line ⋮ Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship ⋮ Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship ⋮ Online bottleneck matching ⋮ A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching ⋮ Online Vehicle Routing Problems: A Survey ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach ⋮ On the refinement of liveness properties of distributed systems ⋮ An optimal deterministic algorithm for online \(b\)-matching
This page was built for publication: The Online Transportation Problem
