An Improved Approximation Algorithm for the s-t Path Movement Problem
This paper considers a movement problem that minimizes the maximum movement of pebbles on a graph to form a path from source vertex to destination vertex . The best known algorithm for this problem is a 7-approximation algorithm developed by Berman, Demaine, and Zadimoghaddam in 2011. We refine t...
Saved in:
Main Authors: | , , , , |
---|---|
格式: | บทความวารสาร |
語言: | English |
出版: |
Science Faculty of Chiang Mai University
2019
|
在線閱讀: | http://it.science.cmu.ac.th/ejournal/dl.php?journal_id=7681 http://cmuir.cmu.ac.th/jspui/handle/6653943832/63855 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Chiang Mai University |
語言: | English |