3 papers
cs.DS2026
Approximation Algorithms for Perfect Fair-Triangle Packing
Mingyang Gong, Zhi-Zhong Chen, Brendan Mumey
In this paper, we study the {\em perfect fair-triangle packing} problem (abbreviated as PFTP), which incorporates the fairness criterion from {\em fair clustering} into the {\em ma…
cs.DS2026
Approximately Partitioning Vertices into Short Paths
Mingyang Gong, Zhi-Zhong Chen, Brendan Mumey
Given a fixed positive integer and a simple undirected graph , the {\em -path partition} problem, denoted by PP for short, aims to find a minimum collection…
cs.DS2024
Approximately covering vertices by order- or longer paths
Mingyang Gong, Zhi-Zhong Chen, Guohui Lin +1
This paper studies , which is to cover as many vertices as possible in a given graph by vertex-disjoint -paths (i.e., paths each with at least five verti…