Worst case analyses of nearest neighbor heuristic for finding the minimum weight k-cycle

• Main Authors: Tanapat Chalarux, Piyashat Sripratak
• Format: Journal
• Published: 2020
• Subjects: Agricultural and Biological Sciences; Biochemistry, Genetics and Molecular Biology; Environmental Science
• Online Access: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85081637716&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/68189
• Institution: Chiang Mai University

© 2020, King Mongkut's Institute of Technology Ladkrabang. All rights reserved. Given a weighted complete graph (Kn, w), where w is an edge weight function, the minimum weight k-cycle problem is to find a cycle of k vertices whose total weight is minimum among all k-cycles. Traveling salesman p...