118 search results - page 3 / 24 » Approximation Schemes for Euclidean k-Medians and Related Pr... |
111
click to vote
STOC
2009
ACM
16 years 6 days ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
122
Voted
WADS
2007
Springer
15 years 5 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
100
click to vote
JCO
2010
14 years 10 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
ADCM
2008
14 years 11 months ago
2008
In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maxiaml and mean square errors as a res...
112
click to vote
IJACT
2008
14 years 11 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...