scientific article; zbMATH DE number 1341907
From MaRDI portal
Publication:4263469
zbMath0928.05016MaRDI QIDQ4263469
Winfried Hochstättler, Sándor P. Fekete, Christoph Moll, S. Kromberg
Publication date: 2 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitydistance in graphsplanar graphsNP-completenessshortest pathsinverse shortest paths
Related Items (4)
NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ The inverse optimal value problem ⋮ Optimization of OSPF Routing in IP Networks
This page was built for publication: