Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi
Format: Article
Language:English
Published: J-STAGE 2017
Subjects:
Q Science (General)
QA Mathematics
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!

Internet

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

Similar Items