scientific article; zbMATH DE number 2079394
From MaRDI portal
Publication:4471353
zbMATH Open1092.68734MaRDI QIDQ4471353FDOQ4471353
Authors: Markus Bläser 
Publication date: 28 July 2004
Title of this publication is not available (Why is that?)
Recommendations
- A new approximation algorithm for the asymmetric TSP with triangle inequality
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- scientific article; zbMATH DE number 2038707
- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
- A near-optimal approximation algorithm for asymmetric TSP on embedded graphs
- Approximating asymmetric TSP in exponential time
- 35/44-approximation for asymmetric maximum TSP with triangle inequality
- scientific article; zbMATH DE number 2119645
- An -approximation algorithm for the asymmetric maximum TSP
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Cited In (6)
- A Lagrangian-based algorithm for a combinatorial motion planning problem
- A new approximation algorithm for the asymmetric TSP with triangle inequality
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
- Traveling salesman path problems
- A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
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 Q4471353)
