scientific article; zbMATH DE number 1507218
From MaRDI portal
Publication:4503938
zbMath0961.68058MaRDI QIDQ4503938
Sebastian Seibert, Walter Unger, Juraj Hromkovič, Ralf Klasing, Hans-Joachim Böckenhauer
Publication date: 28 May 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality ⋮ Improved Approximations for Hard Optimization Problems via Problem Instance Classification ⋮ On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality ⋮ On the Hardness of Reoptimization ⋮ Approximate spanning cactus ⋮ Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
This page was built for publication:
