An improved approximation algorithm for the s-t path movement problem
© 2017, Chiang Mai University. All rights reserved. This paper considers a movement problem that minimizes the maximum movement of pebbles on a graph to form a path from source vertex s to destination vertex t. The best known algorithm for this problem is a 7-approximation algorithm developed by Ber...
Saved in:
Main Authors: | Jindaluang W., Chawachat J., Chouvatut V., Fakcharoenphol J., Kantabutra S. |
---|---|
Format: | Journal |
Published: |
2017
|
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85010824713&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/40989 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
An improved approximation algorithm for the s-t path movement problem
by: Wattana Jindaluang, et al.
Published: (2018) -
An improved approximation algorithm for the s-t path movement problem
by: Wattana Jindaluang, et al.
Published: (2018) -
An Improved Approximation Algorithm for the s-t Path Movement Problem
by: Wattana Jindaluang, et al.
Published: (2019) -
Polynomial-time algorithms for path movement problems on trees and unicyclic graphs
by: Varin Chouvatut, et al.
Published: (2020) -
The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking
by: Chawachat,J., et al.
Published: (2015)