scientific article; zbMATH DE number 2011856
From MaRDI portal
Publication:4437508
zbMath1032.68116MaRDI QIDQ4437508
Ralf Klasing, Dirk Bongartz, Sebastian Seibert, Juraj Hromkovič, Walter Unger, Guido Proietti, Hans-Joachim Böckenhauer
Publication date: 2 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530189.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (5)
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality ⋮ On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality ⋮ Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality ⋮ Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs ⋮ On \(k\)-connectivity problems with sharpened triangle inequality
This page was built for publication:
