Ke Chen's Home Page
About myself
My name is Ke Chen. I am a graduate student in the CS Department at the University of Illinois at
Urbana-Champaign (UIUC), currently in my sixth year.
My advisor is Sariel
Har-Peled. I am mainly interested in clustering algorithms and applications,
approximation algorithms,
and
geometric computing.
Conference Papers
- On k-Median Clustering in High
Dimensions
In Proceedings of 17th ACM-SIAM Symposium on Discrete
Algorithms (SODA), 2006, pp. 1177-1185.
- How to Play a Coloring Game Against
a Color-Blind Adversary
In Proceedings of 22nd ACM
Symposium on Computational Geometry (SoCG), 2006, pp. 44-51.
- The Orienteering Problem in the Plane
Revisited, with Sariel Har-Peled
In Proceedings of 22nd
ACM Symposium on Computational Geometry (SoCG), 2006, pp. 247-254.
- Cost-Aware Caching Algorithms for Distributed Storage Servers, with Shuang Liang, Song Jiang, and Xiaodong Zhang
In Proceedings of 21st International Symposium on Distributed Computing (DISC), 2007.
- A Constant Factor Approximation Algorithm for k-Median
Clustering with Outliers,
Accepted to 19th ACM-SIAM Symposium on Discrete
Algorithms (SODA), 2008. The full version is here.
Journal Papers
- Online Conflict-free Coloring for Intervals
, with A. Fiat, H. Kaplan, M. Levy, J. Matou\v{s}ek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner and E. Welzl
In
SIAM Journal on Computing (SICOMP), vol. 36, 2006, pp. 1342-1359.
- The Euclidean Orienteering Problem Revisited
, with Sariel Har-Peled
To appear in
SIAM Journal on Computing (SICOMP).
- Online Conflict Free Coloring for Halfplanes, Congruent Disks, and
Axis-Parallel Rectangles
, with Haim Kaplan and Micha Sharir.
Submitted to
ACM Transactions on Algorithms (TALG).
- On Coresets for k-Median and k-Means Clustering in
Metric and Euclidean Spaces and Their Applications
Submitted to SIAM Journal on Computing (SICOMP).
Please feel free to send me any comments.
Last modified Nov. 2006 by
kechen@engineering.uiuc.edu