scientific article; zbMATH DE number 2185604

MaRDI QIDQ3024765zbMATH OpenFDO

Authors Chandra Chekuri, Michael A. Bender

Publication date 4 July 2005

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(6)

• On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
• Approximation algorithms for the TSP with sharpened triangle inequality
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
• Approximation Algorithms for the Traveling Salesman Problem with Range Condition
• Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
• An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024765)