A local search 4/3-approximation algorithm for the minimum 3-path partition problem
Full Text: Chen2019_Chapter_ALocalSearch43-approximationAl.pdf
Citation
Y. Chen, R. Goebel, G. Lin, L. Liu, B. Su, W. Tong, Y. Xu, A. Zhang. "A local search 4/3-approximation algorithm for the minimum 3-path partition problem". International Frontiers of Algorithms Workshop (FAW), Sanya, China, pp 14-25, April 2019.| Keywords: | |
| Category: | In Conference |
| Web Links: | Springer |
BibTeX
@incollection{Chen+al:(FAW)19,
author = {Yong Chen and Randy Goebel and Guohui Lin and Longcheng Liu and
Bing Su and Weitian Tong and Yao Xu and An Zhang},
title = {A local search 4/3-approximation algorithm for the minimum 3-path
partition problem},
Pages = {14-25},
booktitle = {International Frontiers of Algorithms Workshop (FAW)},
year = 2019,
}Last Updated: June 08, 2020Submitted by Sabina P
