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

Don Coppersmith, Tomasz Nowicki, Giuseppe Paleologo, Charles Philippe Tresser, Chai Wah Wu. The optimality of the online greedy algorithm in carpool and chairman assignment problems. ACM Transactions on Algorithms, 7(3):37, 2011. [doi]

@article{CoppersmithNPTW11,
  title = {The optimality of the online greedy algorithm in carpool and chairman assignment problems},
  author = {Don Coppersmith and Tomasz Nowicki and Giuseppe Paleologo and Charles Philippe Tresser and Chai Wah Wu},
  year = {2011},
  doi = {10.1145/1978782.1978792},
  url = {http://doi.acm.org/10.1145/1978782.1978792},
  researchr = {https://researchr.org/publication/CoppersmithNPTW11},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Algorithms},
  volume = {7},
  number = {3},
  pages = {37},
}