activity
20082023
most citedCombinatorial Multi-Armed Bandit with General Reward Functions

75 citations · 200 across the 26 of their papers we have counts for

collaborators
Showing cs.CGShow all

8 papers · 1 filter

cs.CG2017★ 2 cited

Odd Yao-Yao Graphs are Not Spanners

Yifei Jin, Jian Li, Wei Zhan

It is a long standing open problem whether Yao-Yao graphs are all spanners [li2002sparse]. Bauer and Damian [bauer2013infinite] showed that all …

cs.CG2017★ 15 cited

Linear Time Approximation Schemes for Geometric Maximum Coverage

Kai Jin, Jian Li, Haitao Wang +2

We study approximation algorithms for the following geometric version of the maximum coverage problem: Let be a set of weighted points in the plane. Let repre…

cs.CG2016★ 1 cited

Stochastic -Center and -Flat-Center Problems

Lingxiao Huang, Jian Li

Solving geometric optimization problems over uncertain data have become increasingly important in many applications and have attracted a lot of attentions in recent years. In this…

cs.CG2015★ 2 cited

Linear Time Approximation Schemes for Geometric Maximum Coverage

Jian Li, Haitao Wang, Bowei Zhang +1

We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. We want to place m a * b re…

cs.CG2015★ 8 cited

A PTAS for the Weighted Unit Disk Cover Problem

Jian Li, Yifei Jin

We are given a set of weighted unit disks and a set of points in Euclidean plane. The minimum weight unit disk cover (\UDC) problem asks for a subset of disks of minimum total weig…

cs.CG2015

Range Queries on Uncertain Data

Jian Li, Haitao Wang

Given a set of uncertain points on the real line, each represented by its one-dimensional probability density function, we consider the problem of building data structures…