99 search results - page 6 / 20 » Approximation algorithms and hardness of integral concurrent... |
STOC
2007
ACM
15 years 10 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
IS
2008
14 years 9 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
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...