Approximation algorithms for geometric median problems
Information Processing Letters
Clustering gene expression patterns
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Feature Selection for Unsupervised Learning
The Journal of Machine Learning Research
Cluster graph modification problems
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Clustering for metric and non-metric distance measures
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Theory of Computing Systems
Graph-modeled data clustering: fixed-parameter algorithms for clique generation
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Deterministic algorithms for rank aggregation and other ranking and clustering problems
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
| Hi-index | 0.89 |
In this paper we consider the cluster editing problem for a special type of graphs, where the vertices represent points on the real line and there is an edge between each two vertices for which the distance between their corresponding points on the line is less than a given constant. We give a polynomial time cluster editing algorithm for this class of graphs.