1983Unpublished venueOpen access

Asymptotic Optimality of Shortest Path Routing

Eli M. Gafni, Dimitri P. Bertsekas

Open full text 7 citations

Abstract

"July 1983"

About this research paper

What this paper is about

"July 1983"

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

"July 1983"

Key concepts: Shortest path problem, Equal-cost multi-path routing, K shortest path routing, Private Network-to-Network Interface, Path (computing), Routing (electronic design automation), Constrained Shortest Path First, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Asymptotic Optimality of Shortest Path Routing — Research Paper | ScholarLens