Worst case analyses of nearest neighbor heuristic for finding the minimum weight k-cycle
© 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...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | 雜誌 |
| 出版: |
2020
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85081637716&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/68189 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|