5595 search results - page 198 / 1119 » Approximation Algorithms for Clustering Problems |
144
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
200
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
148
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
203
click to vote
DASFAA
2007
IEEE
16 years 15 days ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
191
Voted
IPL
2000
15 years 6 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...