Publication:4263469
From MaRDI portal
zbMath0928.05016MaRDI QIDQ4263469
Winfried Hochstättler, Sándor P. Fekete, Christoph Moll, S. Kromberg
Publication date: 2 January 2000
computational complexity; distance in graphs; planar graphs; NP-completeness; shortest paths; inverse shortest paths
Related Items
Reverse maximum flow problem under the weighted Chebyshev distance, NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE, The inverse optimal value problem, Optimization of OSPF Routing in IP Networks