Level graphs and approximate shortest path algorithms

DOI10.1002/NET.3230220707MaRDI QIDQ4022734zbMATH OpenOpenAlexFDO

Authors Jacob Shapiro, Jerry Waxman, Danny Nir

Publication date 17 January 1993

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230220707

zbMATH Keywords

approximation shortest pathslevel graphshortest path generationtime complexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 840679
• scientific article; zbMATH DE number 637523
• scientific article; zbMATH DE number 434479
• scientific article; zbMATH DE number 1185597
• A Practical Shortest Path Algorithm with Linear Expected Time

Cited in

(6)

• Heuristic shortest path algorithms for transportation applications: state of the art
• scientific article; zbMATH DE number 434479 (Why is no real title available?)
• scientific article; zbMATH DE number 3843669 (Why is no real title available?)
• scientific article; zbMATH DE number 1185597 (Why is no real title available?)
• scientific article; zbMATH DE number 637523 (Why is no real title available?)
• scientific article; zbMATH DE number 840679 (Why is no real title available?)

Describes a project that uses

Uses Software

• LGS

This page was built for publication: Level graphs and approximate shortest path algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022734)