Approximating the directed path partition problem
Work
Year: 2024
Type: article
Abstract: Given a digraph G=(V,E), the k-path partition problem aims to find a minimum collection of vertex-disjoint directed paths, each of order at most k, to cover all the vertices of V. The problem has vari... more
Source: Information and Computation
Institutions Hangzhou Dianzi University, Tokyo Denki University, University of Alberta, Georgia Southern University
Cites: 23
Cited by: 4
Related to: 10
FWCI: 4.795
Citation percentile (by year/subfield): 76.37
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,630
Funders Ministry of Education, Culture, Sports, Science and Technology, National Natural Science Foundation of China, National Natural Science Foundation of China, Ministry of Science and Technology of the People's Republic of China, Ministry of Science and Technology of the People's Republic of China +1 more