Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems

Wei Yu 0011, Zhaohui Liu. Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems. In Yixin Cao 0001, Jianer Chen, editors, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings. Volume 10392 of Lecture Notes in Computer Science, pages 542-554, Springer, 2017. [doi]

Abstract

Abstract is missing.