Publication:4535019
From MaRDI portal
zbMath0986.90082MaRDI QIDQ4535019
Lars Engebretsen, Marek Karpinski
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760201
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Differential approximation of NP-hard problems with equal size feasible solutions, Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s), Cooperative TSP, Approximation algorithms for some vehicle routing problems, Polynomial approximation algorithms with performance guarantees: an introduction-by-example, Differential approximation results for the traveling salesman problem with distances 1 and 2, When the greedy algorithm fails, TSP with bounded metrics, Restricted Common Superstring and Restricted Common Supersequence