Abstract
We present "market research" for the field of combinatorial algorithms and algorithm engineering, attempting to determine which algorithmic problems are most in demand in applications. We analyze 1,503,135 WWW hits recorded on the Stony Brook Algorithms Repository (http://www.cs.sunysb.edu/~algorith), to determine the relative level of interest among 75 algorithmic problems and the extent to which publicly available algorithm implementations satisfy this demand.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. G . Gonnet and R. Baeza-Yates . Handbook of Algorithms and Data Structures . Addison-Wesley Wokingham England second edition 1991 .
2. LEDA: a platform for combinatorial and geometric computing
3. Ranger: a tool for nearest neighbor search in high dimensions
4. R . Sedgewick . Algorithms in C++ . Addison-Wesley Reading MA 1992 .
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献