757 search results - page 104 / 152 » On the hardness of approximating Max-Satisfy |
ISPD
1998
ACM
15 years 2 months ago
1998
ACM
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
117
click to vote
COCOON
2004
Springer
15 years 1 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
STOC
2005
ACM
15 years 3 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
BIRTHDAY
2009
Springer
15 years 1 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...