Qilong Feng

activity

20182025

most citedAn Improved FPT Algorithm for the Flip Distance Problem

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2022

New Approximation Algorithms for Fair $k$ -median Problem

Di Wu, Qilong Feng, Jianxin Wang

The fair $k$ -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 $P$ of points in the Euclidean plane and two triangulations of $P$ , the flip distance between these two triangulations is the minimum number of flips required…

cs.CG2018

Speeding Up Constrained $k$ -Means Through 2-Means

Qilong Feng, Bin Fu

For the constrained 2-means problem, we present a $O (d n + d (\frac{1}{ε})^{O (\frac{1}{ε})} lo g n)$ time algorithm. It generates a collection $U$ of approximate center pairs $(…

New Approximation Algorithms for Fair k-median Problem

An Improved FPT Algorithm for the Flip Distance Problem

Speeding Up Constrained k-Means Through 2-Means

New Approximation Algorithms for Fair $k$ -median Problem

Speeding Up Constrained $k$ -Means Through 2-Means