activity
20192025
most citedA constant FPT approximation algorithm for hard-capacitated k-means

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

collaborators

5 papers

cs.CG2025

FPT Constant Approximation Algorithms for Colorful Sum of Radii

Shuilian Liu, Gregory Gutin, Yicheng Xu +1

We study the colorful sum of radii problem, where the input is a point set partitioned into classes , along with per-class outlier bounds $m_1, m_2, \dots…

cs.GT2024

Weighted Envy-Freeness in House Allocation

Sijia Dai, Yankai Chen, Xiaowei Wu +2

The classic house allocation problem involves assigning houses to agents based on their utility functions, ensuring each agent receives exactly one house. A key criterion i…

cs.LG2020★ 1 cited

Too Much Information Kills Information: A Clustering Perspective

Yicheng Xu, Vincent Chau, Chenchen Wu +3

Clustering is one of the most fundamental tools in the artificial intelligence area, particularly in the pattern recognition and learning theory. In this paper, we propose a simple…

cs.NI2020

Online Joint Placement and Allocation of Virtual Network Functions with Heterogeneous Servers

Yicheng Xu, Vincent Chau, Chenchen Wu +2

Network Function Virtualization (NFV) is a promising virtualization technology that has the potential to significantly reduce the expenses and improve the service agility. NFV make…

cs.DS2019★ 3 cited

A constant FPT approximation algorithm for hard-capacitated k-means

Yicheng Xu, Rolf H. Möhring, Dachuan Xu +2

Hard-capacitated -means (HCKM) is one of the fundamental problems remaining open in combinatorial optimization and data mining areas. In this problem, one is required to partiti…