The optimality of the online greedy algorithm in carpool and chairman assignment problems
From MaRDI portal
Publication:3189021
DOI10.1145/1978782.1978792zbMath1295.68232OpenAlexW2083291396MaRDI QIDQ3189021
Don Coppersmith, Giuseppe Paleologo, Chai Wah Wu, Tomasz Nowicki, Charles Tresser
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1978782.1978792
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (8)
Almost Beatty Partitions ⋮ Error diffusion on acute simplices: invariant tiles ⋮ The Offline Carpool Problem Revisited ⋮ Webster sequences, apportionment problems, and just-in-time sequencing ⋮ Error diffusion on simplices: the structure of bounded invariant tiles ⋮ Whose Turn Is It to Drive Today? ⋮ Bounding the errors for convex dynamics on one or more polytopes ⋮ An optimization model and a solution algorithm for the many-to-many car pooling problem
This page was built for publication: The optimality of the online greedy algorithm in carpool and chairman assignment problems