Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ren, Guangpeng"'
Autor:
Lin, Junyuan, Ren, Guangpeng
In this paper, we propose a deterministic algorithm that approximates the optimal path cover on weighted undirected graphs. Based on the 1/2-Approximation Path Cover Algorithm by Moran et al., we add a procedure to remove the redundant edges as the a
Externí odkaz:
http://arxiv.org/abs/2101.08947