IBM Research Report The Optimality of the On-Line Greedy Algorithm in Carpool and Chairman Assignment Problems

[1]  Tomasz Nowicki,et al.  Convex dynamics: properties of invariant sets , 2004 .

[2]  Robert Tijdeman.  The chairman assignment problem , 1980, Discret. Math..

[3]  Chai Wah Wu,et al.  Error bounds for error diffusion and related digital halftoning algorithms , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[4]  H. G Meijer.  On a distribution problem in finite sets , 1973 .

[5]  Chai Wah Wu,et al.  The mathematics of halftoning , 2003, IBM J. Res. Dev..

[6]  Yuval Rabani,et al.  Fairness in scheduling , 1995, SODA '95.

[7]  C. Tresser,et al.  Dynamique de la diffusion de l'erreur sur plusieurs polytopes , 2004 .

[8]  Sanjoy K. Baruah,et al.  Proportionate progress: A notion of fairness in resource allocation , 1993, Algorithmica.

[9]  M. Martens,et al.  Convex dynamics and applications , 2004, Ergodic Theory and Dynamical Systems.

[10]  Robert Tijdeman.  On a Distribution Problem in Finite and Countable Sets , 1973, J. Comb. Theory, Ser. A.

[11]  Ronald Fagin,et al.  A Fair Carpool Scheduling Algorithm , 1983, IBM J. Res. Dev..