An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs
The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard optimization problems. Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space comp...
Saved in:
Main Authors: | Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi |
---|---|
Format: | Article |
Language: | English |
Published: |
J-STAGE
2017
|
Subjects: | |
Online Access: | http://eprints.utem.edu.my/id/eprint/20862/2/25_639%20Improved%20TSP5%20published%20paper.pdf http://eprints.utem.edu.my/id/eprint/20862/ https://www.jstage.jst.go.jp/article/ipsjjip/25/0/25_639/_article/-char/en https://doi.org/10.2197/ipsjjip.25.639 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Polynomial-Space Exact Algorithms For Traveling Salesman Problem In Degree Bounded Graphs
by: Md Yunos, Norhazwani
Published: (2017) -
Discovering factors of graph polynomials
by: Yow, Kai Siong, et al.
Published: (2019) -
On the cardinality of twelfth degree polynomial
by: Lasaraiya, Suriana, et al.
Published: (2016) -
Dominating Sets and Domination Polynomials of Graphs
by: Alikhani, Saeid
Published: (2009) -
Graph polynomial associated to some graphs of certain finite nonabelian groups
by: Najmuddin, Nabilah
Published: (2021)