3 citations · 6 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022
New Approximation Algorithms for Fair -median Problem
Di Wu, Qilong Feng, Jianxin Wang
The fair -median problem is one of the important clustering problems. The current best approximation ratio is 4.675 for this problem with 1-fair violation, which was proposed by…
cs.DS2019★ 2 cited
An Improved FPT Algorithm for the Flip Distance Problem
Qilong Feng, Shaohua Li, Xiangzhong Meng +1
Given a set of points in the Euclidean plane and two triangulations of , the flip distance between these two triangulations is the minimum number of flips required…
cs.DS2014
Algorithms for Maximum Agreement Forest of Multiple General Trees
Feng Shi, Jianer Chen, Qilong Feng +2
The Maximum Agreement Forest (Maf) problem is a well-studied problem in evolutionary biology, which asks for a largest common subforest of a given collection of phylogenetic trees…