Scaling Algorithms for the Shortest Paths Problem
SIAM Journal on Computing
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Finding Real-Valued Single-Source Shortest Paths
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
SPT_L shortest path algorithms: review, new proposals and some experimental results
SPT_L shortest path algorithms: review, new proposals and some experimental results
Clock Scheduling and Clocktree Construction for High Performance ASICS
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Negative cycle detection problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Label constrained shortest path estimation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
This is an experimental study of algorithms for the shortest-path feasibility problem: Given a directed weighted graph, find a negative cycle or present a short proof that none exists. We study previously known and new algorithms. Our testbed is more extensive than those previously used, including both static and incremental problems, as well as worst-case instances. We show that, while no single algorithm dominates, a small subset (including new algorithms) has very robust performance in practice. Our work advances the state of the art in the area.