118 search results - page 7 / 24 » Approximation Schemes for Euclidean k-Medians and Related Pr... |
TSP
2010
13 years 2 months ago
2010
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
SODA
2004
ACM
13 years 9 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 ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
ECCC
2000
13 years 7 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...