Database Paper Browser

Back to papers

Exceeding Expectations and Clustering Uncertain Data

Summary: True approximation algorithms for k‑center clustering on probabilistic/uncertain data that preserve the number of centers, closing gaps in prior work. Introduce an "exceeding expectations" objective (contribution above expectation) and general optimization techniques under uncertainty. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1499
Venue
PODS
Year
2009
Pagerank
4.1945683e-05
Overall Rank
12,299 | 14.44%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,311 Large-Scale Uncertainty Management Systems: Learning and Exploiting Your Data (Tutorial Summary) 2009 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,860 Approximation Algorithms for Clustering Uncertain Data 2008 PODS 0.0001028857
Previous Page 1 / 1 Next

Semantically Similar Papers