Send-and-split method for minimum-concave-cost network flows
Mathematics of Operations Research
Analysis of preflow push algorithms for maximum network flow
SIAM Journal on Computing
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
The influence of caches on the performance of heaps
Journal of Experimental Algorithmics (JEA)
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial algorithms test sets CATS: the ACM/EATCS platform for experimental research
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Experimental Study of Minimum Cut Algorithms
Experimental Study of Minimum Cut Algorithms
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
| Hi-index | 0.00 |
In this paper we address the issue of developing test sets for computational evaluation of algorithms. We discuss both test families for comparing several algorithms and selecting one to use in an application, and test families for predicting algorithm performance in practice.