5595 search results - page 238 / 1119 » Approximation Algorithms for Clustering Problems |
169
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
143
click to vote
IDA
2003
Springer
15 years 11 months ago
2003
Springer
The recent developments in computer and communication technologies gave rise to Personal Communication Systems. Due to the nature of the PCS, the bandwidth allocation problem arise...
148
Voted
PKDD
2004
Springer
15 years 11 months ago
2004
Springer
The more sophisticated fuzzy clustering algorithms, like the Gustafson–Kessel algorithm [11] and the fuzzy maximum likelihood estimation (FMLE) algorithm [10] offer the possibil...
181
Voted
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
147
click to vote
IPL
2010
15 years 4 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...