Sciweavers

8 search results - page 1 / 2
» A note on concentration of submodular functions
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 11 months ago
A note on concentration of submodular functions
We survey a few concentration inequalities for submodular and fractionally subadditive functions of independent random variables, implied by the entropy method for self-bounding f...
Jan Vondrák
DISOPT
2008
82views more  DISOPT 2008»
13 years 11 months ago
Note on pseudolattices, lattices and submodular linear programs
A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain c...
Ulrich Faigle, Britta Peis
COMBINATORICS
2000
84views more  COMBINATORICS 2000»
13 years 10 months ago
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large
We study the limiting distribution of the height in a generalized trie in which external nodes are capable to store up to b items (the so called b-tries). We assume that such a tr...
Charles Knessl, Wojciech Szpankowski
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 8 months ago
Amplified Hardness of Approximation for VCG-Based Mechanisms
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
Shaddin Dughmi, Hu Fu, Robert Kleinberg
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 8 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...