The greedy travelling salesman's problem

DOI10.1002/net.3230090406zbMath0428.90071OpenAlexW2003476672MaRDI QIDQ3865869

T. A. Jenkyns

Publication date: 1979

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230090406

zbMATH Keywords

greedy algorithmgraph theorytraveling salesman problemHamiltonian circuitsHamiltonian pathsnon-negatively-weighted independent system

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Nonlinear programming (90C30) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Related Items

The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings ⋮ A greedy approximation algorithm for constructing shortest common superstrings ⋮ Recognition of overlap graphs ⋮ Robust Independence Systems ⋮ Informative path planning as a maximum traveling salesman problem with submodular rewards

Cites Work

• Minimum partition of a matroid into independent subsets