5595 search results - page 307 / 1119 » Approximation Algorithms for Clustering Problems |
179
click to vote
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
172
click to vote
LCN
2005
IEEE
16 years 8 days ago
2005
IEEE
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
189
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
176
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
159
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...