The optimality of the online greedy algorithm in carpool and chairman assignment problems

Don Coppersmith, Tomasz Nowicki, Giuseppe Paleologo, Charles Tresser, Chai Wah WuACM Transactions on Algorithms 2011 · DOI

Abstract

We study several classes of related scheduling problems including the carpool problem, its generalization to arbitrary inputs and the chairman assignment problem. We derive both lower and upper bounds for online algorithms solving these problems. We show that the greedy algorithm is optimal among online algorithms for the chairman assignment problem and the generalized carpool problem. We also consider geometric versions of these problems and show how the bounds adapt to these cases.
BibTeX
@article{coppersmith2011optimality,
  author = {Don Coppersmith and Tomasz Nowicki and Giuseppe Paleologo and Charles Tresser and Chai Wah Wu},
  title = {{The optimality of the online greedy algorithm in carpool and chairman assignment problems}},
  journal = {ACM Transactions on Algorithms},
  year = {2011},
  doi = {10.1145/1978782.1978792},
}

Loading related content...

Figure