Search
for Author
All Reviews
Nowicki, Tomasz
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
Date Reviewed
1
-
1
of
1
reviews
The optimality of the online greedy algorithm in carpool and chairman assignment problems
Coppersmith D., Nowicki T., Paleologo G., Tresser C., Wu C. ACM Transactions on Algorithms 7(3): 1-22, 2011. Type: Article
The chairman assignment problem is stated thus: “Suppose
k
states form a union and every year a union chairman has to be selected in such a way that at any time the accumulated number of chairmen from each ...
...
Dec 28 2011
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud
®
Terms of Use
|
Privacy Policy