(1,2)-HAMILTONIAN COMPLETION ON A MATCHING
From MaRDI portal
Publication:2841988
DOI10.1142/S0129054113500019zbMath1268.90111OpenAlexW1981720915MaRDI QIDQ2841988
Paweł Zalewski, Marcin Bienkowski
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054113500019
Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
Evolutionary operators for the Hamiltonian completion problem ⋮ Exact algorithms for the equitable traveling salesman problem
Cites Work
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
- Approximating maximum weight cycle covers in directed graphs with weights zero and one
- The approximability of the weighted Hamiltonian path completion problem on a tree
- The Traveling Salesman Problem with Distances One and Two
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: (1,2)-HAMILTONIAN COMPLETION ON A MATCHING
