2 citations · 2 across the 4 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2020
A Generalization of Self-Improving Algorithms
Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin +1
Ailon et al. [SICOMP'11] proposed self-improving algorithms for sorting and Delaunay triangulation (DT) when the input instances follow some unknown \emph{product…
cs.CG2019
A note on self-improving sorting with hidden partitions
Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin
We study self-improving sorting with hidden partitions. Our result is an optimal algorithm which runs in expected time O(H(π(I)) + n), where I is the given input which contains n e…
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…