scientific article; zbMATH DE number 1182573

MaRDI QIDQ4400643zbMATHFDO

Authors Guoliang Xue, Du Ding-Zhu, Frank K. Hwang

Publication date 10 February 1999

zbMATH Keywords

potential reduction algorithm\(\varepsilon\)-optimal solution

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Computing the shortest network under a fixed topology
• Publication:4945794
• Faster algorithms for the shortest path problem
• Faster algorithms for shortest path and network flow based on graph decomposition
• An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology
• Optimally fast shortest path algorithms for some classes of graphs
• scientific article; zbMATH DE number 1559433
• The shortest network under a given topology
• An algorithm for finding the \(k\) quickest paths in a network
• Faster network algorithms based on graph decomposition

Cited in

(1)

• O(n log n)-average-time algorithm for shortest network under a given topology

This page was built for publication:

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