scientific article; zbMATH DE number 1839451
From MaRDI portal
Publication:4782716
zbMath1003.90035MaRDI QIDQ4782716
Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
Publication date: 2 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2138/21380275
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Differential approximation results for the traveling salesman and related problems ⋮ Approximation algorithms for some vehicle routing problems ⋮ Differential approximation of NP-hard problems with equal size feasible solutions ⋮ The maximum \(f\)-depth spanning tree problem ⋮ Differential approximation results for the traveling salesman problem with distances 1 and 2
This page was built for publication:
