On the optimality of Bellman-Ford-Moore shortest path algorithm.
Theoretical Computer Science(2016)
摘要
We prove a general lower bound on the size of switching-and-rectifier networks over any semiring of zero characteristic, including the (min,+) semiring. Using it, we show that the classical dynamic programming algorithm of Bellman, Ford and Moore for the shortest s-t path problem is optimal, if only Min and Sum operations are allowed.
更多查看译文
关键词
Shortest paths,Matrix multiplication,Dynamic programming,Tropical semiring,Lower bounds
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络