Approximation algorithms for the k-depots Hamiltonian path problem

2021 ◽  
Author(s):  
Yichen Yang ◽  
Zhaohui Liu ◽  
Wei Yu
Keyword(s):  
Approximation Algorithms ◽  
Hamiltonian Path ◽  
Hamiltonian Path Problem

scholarly journals Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem

2011 ◽  
Vol 21 (12) ◽  
pp. 1434-1451 ◽  
Author(s):  
Riddhi Doshi ◽  
Sai Yadlapalli ◽  
Sivakumar Rathinam ◽  
Swaroop Darbha
Keyword(s):  
Approximation Algorithms ◽  
Hamiltonian Path ◽  
Hamiltonian Path Problem

scholarly journals A successful algorithm for the undirected Hamiltonian path problem

1985 ◽  
Vol 10 (2) ◽  
pp. 179-195 ◽  
Author(s):  
Gerald L. Thompson ◽  
Sharad Singhal
Keyword(s):  
Hamiltonian Path ◽  
Hamiltonian Path Problem

Expected Computation Time for Hamiltonian Path problem

1987 ◽  
Vol 16 (3) ◽  
pp. 486-502 ◽  
Author(s):  
Yuri Gurevich ◽  
Saharon Shelah
Keyword(s):  
Hamiltonian Path ◽  
Computation Time ◽  
Hamiltonian Path Problem

scholarly journals New Sufficient Conditions for Hamiltonian Paths

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
M. Sohel Rahman ◽  
M. Kaykobad ◽  
Jesun Sahariar Firoz
Keyword(s):  
Hamiltonian Path ◽  
Sufficient Conditions ◽  
Hamiltonian Paths ◽  
Hamiltonian Path Problem

A Hamiltonian path in a graph is a path involving all the vertices of the graph. In this paper, we revisit the famous Hamiltonian path problem and present new sufficient conditions for the existence of a Hamiltonian path in a graph.

Sign in / Sign up

Export Citation Format

Share Document