We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
Johanna Becker, Zsolt Csizmadia, Alexandre Laugier...
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...