Sciweavers

62
Voted
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
15 years 2 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar