5595 search results - page 423 / 1119 » Approximation Algorithms for Clustering Problems |
159
click to vote
SDM
2010
SIAM
15 years 8 months ago
2010
SIAM
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
187
click to vote
MP
1998
15 years 6 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
184
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
191
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
170
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...