5595 search results - page 243 / 1119 » Approximation Algorithms for Clustering Problems |
165
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...
140
click to vote
GLOBECOM
2006
IEEE
16 years 14 days ago
2006
IEEE
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...
233
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
190
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
179
click to vote
WADS
2007
Springer
16 years 16 days ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...