CORR
2012
Springer
12 years 2 days ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
PODS
2011
ACM
12 years 7 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
ICDT
2011
ACM
12 years 7 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
ALGORITHMICA
2011
12 years 8 months ago
2011
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
FOCS
2010
IEEE
13 years 2 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
DCG
2010
13 years 4 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...