scientific article
From MaRDI portal
Publication:3024765
zbMath1063.68700MaRDI QIDQ3024765
Chandra Chekuri, Michael A. Bender
Publication date: 4 July 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (6)
Approximation Algorithms for the Traveling Salesman Problem with Range Condition ⋮ Approximation algorithms for the TSP with sharpened triangle inequality ⋮ An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality ⋮ Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem ⋮ On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality ⋮ Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
This page was built for publication: