scientific article; zbMATH DE number 2081007

zbMath1077.90517MaRDI QIDQ4474107

David Scot Taylor, Erlebach, Thomas, Konrad Schlude, Martin Gantenbein, Gabriele Neyer, Paolo Penna, Daniel Hürlimann, Aris Pagourtzis, K. Steinhöfel, Peter Widmayer

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230390.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Traffic problems in operations research (90B20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)