192 search results - page 20 / 39 » A Constant-Factor Approximation Algorithm for the Multicommo... |
115
Voted
IPSN
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
165
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
107
Voted
WAOA
2007
Springer
15 years 8 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
111
Voted
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
128
click to vote
JCO
2010
15 years 1 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...