667 search results - page 84 / 134 » Approximation algorithms for connected facility location pro... |
78
Voted
SIGMETRICS
2002
ACM
15 years 6 days ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
121
click to vote
IPCO
2007
15 years 2 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
101
click to vote
PVLDB
2010
14 years 11 months ago
2010
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
DCOSS
2009
Springer
15 years 7 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
113
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...