The Online Transportation Problem
From MaRDI portal
Publication:4490792
DOI10.1137/S0895480198342310zbMath0949.68119MaRDI 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
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
05D15: Transversal (matching) theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Approximating \(k\)-forest with resource augmentation: a primal-dual approach, Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm, Online bottleneck matching on a line, Serve or skip: the power of rejection in online bottleneck matching, A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching, On the refinement of liveness properties of distributed systems, An optimal deterministic algorithm for online \(b\)-matching, Online bottleneck semi-matching, A \(o(n)\)-competitive deterministic algorithm for online matching on a line, Online bottleneck matching, Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship, A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line, Online Vehicle Routing Problems: A Survey