TSP with bounded metrics (Q2495398)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	TSP with bounded metrics	scientific article

Statements

scholarly article

0 references

TSP with bounded metrics (English)

0 references

Lars Engebretsen

0 references

Marek Karpinski

0 references

Journal of Computer and System Sciences

0 references

publication date

30 June 2006

0 references

zbMATH Keywords

approximation hardness

0 references

metric tsp

0 references

bounded metric

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jcss.2005.12.001

0 references

Proof verification and the hardness of approximation problems

0 references

8/7-approximation algorithm for (1,2)-TSP

0 references

0 references

Improved Lower Bounds on the Approximability of the Traveling Salesman Problem

0 references

Bipartite multigraphs with expander-like properties

0 references

An explicit lower bound for TSP with distances one and two

0 references

0 references

Some optimal inapproximability results

0 references

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

0 references

0 references

On the approximability of the traveling salesman problem (extended abstract)

0 references

The Traveling Salesman Problem with Distances One and Two

0 references

When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.JCSS.2005.12.001

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2495398

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2495398&oldid=39124257"