Approximation algorithms for the k-depots Hamiltonian path problem
Sign Up to like & getrecommendations! Published in 2021 at "Optimization Letters"
DOI: 10.1007/s11590-021-01774-5
Abstract: We consider a multiple-depots extension of the classic Hamiltonian path problem where k salesmen are initially located at different depots. To the best of our knowledge, no algorithm for this problem with a constant approximation… read more here.
Keywords: approximation; hamiltonian path; path problem; approximation ratio ... See more keywords
Nanopore decoding for a Hamiltonian path problem.
Sign Up to like & getrecommendations! Published in 2021 at "Nanoscale"
DOI: 10.1039/d0nr09031j
Abstract: DNA computing has attracted attention as a tool for solving mathematical problems due to the potential for massive parallelism with low energy consumption. However, decoding the output information to a human-recognizable signal is generally time-consuming… read more here.
Keywords: nanopore decoding; hamiltonian path; path problem; dna ... See more keywords