4894 search results - page 275 / 979 » The Guarding Problem - Complexity and Approximation |
204
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
146
click to vote
SCHEDULING
2008
15 years 6 months ago
2008
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
202
click to vote
PODS
1999
ACM
15 years 11 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
171
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
197
Voted
JCP
2007
15 years 6 months ago
2007
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...