Join Our Newsletter

CORR

2012

Springer

8 years 1 months ago
2012

Springer

In many information networks, data items – such as updates in social networks, news ﬂowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...

PODS

2011

ACM

8 years 8 months ago
2011

ACM

In deletion propagation, tuples from the database are deleted in order to reﬂect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...

ICDT

2011

ACM

8 years 9 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

8 years 9 months ago
2011

Algorithms for determining quality/cost/price tradeoﬀs 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

9 years 3 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

9 years 6 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

9 years 7 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

10 years 12 days ago
2009

ACM

Given a set system (X, R), the hitting set problem is to ﬁnd a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...