scientific article; zbMATH DE number 1954373

zbMath1027.68097MaRDI QIDQ4415244

Walter Unger, Ralf Klasing, Juraj Hromkovič, Dirk Bongartz, Sebastian Seibert, Guido Proietti, Hans-Joachim Böckenhauer

Publication date: 28 July 2003

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

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

zbMATH Keywords

augmentationapproximation algorithminapproximabilityminimum-cost biconnected spanning subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality

This page was built for publication: