7006 search results - page 186 / 1402 » Approximation Algorithms |
127
click to vote
COLOGNETWENTE
2008
15 years 4 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
102
click to vote
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
126
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
133
click to vote
JSC
2008
15 years 3 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
104
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...