A Structural Equivalence of Symmetric TSP to a Constrained Group Steiner Tree Problem
Data Structures and Algorithms
2026-02-06 v1 Discrete Mathematics
Combinatorics
Geometric Topology
Abstract
We present a brief structural equivalence between the symmetric TSP and a constrained Group Steiner Tree Problem (cGSTP) defined on a simplicial incidence graph. Given the complete weighted graph on the city set V, we form the bipartite incidence graph between triangles and edges. Selecting an admissible, disk-like set of triangles induces a unique boundary cycle. With global connectivity and local regularity constraints, maximizing net weight in the cGSTP is exactly equivalent to minimizing the TSP tour length.
Keywords
Cite
@article{arxiv.2602.05773,
title = {A Structural Equivalence of Symmetric TSP to a Constrained Group Steiner Tree Problem},
author = {Yılmaz Arslanoğlu},
journal= {arXiv preprint arXiv:2602.05773},
year = {2026}
}
Comments
4 pages, 3 figures, brief communication note to be submitted to ORL