Metraipolis › archive › dc_39fea16173bf

Traveling Salesman Problem on Graphs with Proportional Independent Set — arXiv:2610.41178

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41178
License (as archived)
CC0-1.0
Archived
2026-11-03T08:18:49.385Z
SHA-256 of the archived text
ff190f8aa7bb81ed5c572e8721c185cc475a69029618595835eb8118fb2c11f3
Stable URL of this page
https://metraipolis.com/documento/dc_39fea16173bf

How to cite

Traveling Salesman Problem on Graphs with Proportional Independent Set — arXiv:2610.41178 — arXiv (en), https://arxiv.org/abs/2610.41178 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_39fea16173bf (Metraipolis archive dc_39fea16173bf, sha256 ff190f8aa7bb81ed5c572e8721c185cc475a69029618595835eb8118fb2c11f3)
BibTeX
@misc{dc39fea16173bf,
  title = {Traveling Salesman Problem on Graphs with Proportional Independent Set — arXiv:2610.41178},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41178},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_39fea16173bf; sha256 ff190f8aa7bb81ed5c572e8721c185cc475a69029618595835eb8118fb2c11f3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41178. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give a deterministic algorithm for minimum-cost Hamiltonian cycle in undirected graphs with arbitrary real edge costs and an independent set of size at least $\alpha n$, for any fixed $3/7<\alpha\le1/2$. It runs in $O^*(\gamma(\alpha)^n)$ time for an explicit constant $\gamma(\alpha)<2$; for bipartite graphs, the bound is $O^*((1+2\sqrt2)^{n/2})\approx O^*(1.957^n)$. The algorithm is based on a restricted Held--Karp dynamic program. Its state enumeration uses structural properties of minimum-cost assignments arising from a regular triangulation of a product of simplices.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.41178 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:05:23.801Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).