The average solution of a TSP instance in a graph

DOI10.1002/JGT.23232MaRDI QIDQ6978645zbMATH OpenFDO

Authors Stijn Cambie

Publication date 27 May 2025

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JGT.23232

zbMATH Keywords

average distanceSteiner distancetravelling salesman problemTSP distanceWiener index

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Cites work

• A lower bound for the steiner tree problem in directed graphs
• An asymptotic resolution of a problem of Plesník
• scientific article; zbMATH DE number 687700 (Why is no real title available?)
• On subexponential parameterized algorithms for Steiner tree and directed subset TSP on planar graphs
• On the sum of all distances in a graph or digraph
• Spanning trees with many leaves and average distance
• Steiner distance in graphs
• The average Steiner distance of a graph
• The Steiner Wiener index of a graph
• The traveling salesman problem and its variations

Cited in

(1)

• The maximum Wiener index of a uniform hypergraph

This page was built for publication: The average solution of a TSP instance in a graph

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