478 search results - page 77 / 96 » Approximation algorithms for general packing problems and th... |
VLDB
2011
ACM
13 years 3 months ago
2011
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
PODC
2005
ACM
14 years 2 months ago
2005
ACM
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
ESA
2010
Springer
13 years 10 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
LATIN
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...