ScholarLens Back to search
2015•Electronic colloquium on computational complexityRequires access

On the Optimality of Bellman-Ford-Moore Shortest Path Algorithm.

Stasys Jukna, Georg Schnitger

Open publisher page 0 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Shortest path problem, Dynamic programming, Path (computing), Semiring, Mathematics, Combinatorics, Algorithm, Bellman equation

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the Optimality of Bellman-Ford-Moore Shortest Path Algorithm. — Research Paper | ScholarLens