//-->
The Complexity of Eliminating Dominated Strategies
Gilboa, Itzhak, (1989)
An O (n log n) Randomizing Algorithm for the Weighted Euclidean l-Center Problem
Megiddo, Nimrod, (1984)
Functions for Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
Zemel, Eitan, (1978)