scientific article; zbMATH DE number 1953081
From MaRDI portal
Publication:4414484
zbMath1022.90035MaRDI QIDQ4414484
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730047.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains ⋮ Shortest path and maximum flow problems in networks with additive losses and gains
This page was built for publication:
