Database Paper Browser

Back to papers

Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates

Summary: Extends max-sum diversification to monotone submodular valuations: a natural greedy yields a 2-approx for cardinality constraints and a single-swap local search gives a 2-approx for arbitrary matroids (extending Nemhauser–Wolsey–Fisher). For dynamic single-element or pairwise distance perturbations in the modular case, shows stability via at most one swap to maintain a 3-approx for bounded perturbations, measuring robustness by swap count. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1574
Venue
PODS
Year
2012
Pagerank
0.00010748322
Overall Rank
1,725 | 88.01%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 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,667 Structured Search Result Differentiation 2009 VLDB 0.00010960247
4,181 DivDB: A System for Diversifying Query Results 2011 VLDB 6.3789851e-05
4,710 BROAD: Diversified Keyword Search in Databases 2011 VLDB 5.9794343e-05
Previous Page 1 / 1 Next

Semantically Similar Papers