The Online Transportation Problem: On the Exponential Boost of One Extra Server
From MaRDI portal
Publication:5458531
DOI10.1007/978-3-540-78773-0_20zbMath1136.68350OpenAlexW2163711814MaRDI QIDQ5458531
Christine Chung, Patchrawat Uthaisombut, Kirk R. Pruhs
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.conncoll.edu/cgi/viewcontent.cgi?article=1008&context=comscifacpub
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (7)
A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line ⋮ Serve or skip: the power of rejection in online bottleneck matching ⋮ A \(o(n)\)-competitive deterministic algorithm for online matching on a line ⋮ 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 ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach
This page was built for publication: The Online Transportation Problem: On the Exponential Boost of One Extra Server
