Affiliation:
1. Institute of Computer Science, University of Wroclaw, Joliot-Curie 15, 50-383 Wroclaw, Poland
Abstract
We consider the problem of computing a minimum-weight Hamiltonian cycle on an undirected graph with edges' weights from set {0, 1, 2}, where 0-weight edges create a perfect matching of the graph. We provide a (4/3)-approximation algorithm and show that the problem is APX-complete.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献