Abstract
We study the problem of covering the vertices of an undirected weighted graph with a given number of trees (cycles, paths) to minimize the weight of the maximum weight tree (cycle, path). Improved inapproximability lower bounds are proved and better approximation algorithms are designed for several variants of this problem.
Author supplied keywords
Cite
CITATION STYLE
Yu, W., & Liu, Z. (2017). Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10392 LNCS, pp. 542–554). Springer Verlag. https://doi.org/10.1007/978-3-319-62389-4_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
