4894 search results - page 158 / 979 » The Guarding Problem - Complexity and Approximation |
188
click to vote
ESCAPE
2007
Springer
16 years 18 days ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
165
click to vote
JPDC
2007
15 years 6 months ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
183
click to vote
IPL
2002
15 years 6 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
148
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
156
click to vote
ICDT
2005
ACM
15 years 12 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...