Sciweavers

47 search results - page 7 / 10
» Improved Approximation Guarantees for Lower-Bounded Facility...
Sort
View
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
15 years 10 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
INFOCOM
2009
IEEE
15 years 4 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa
FOCS
2000
IEEE
15 years 2 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg
TDSC
2011
14 years 4 months ago
An Obfuscation-Based Approach for Protecting Location Privacy
—The pervasive diffusion of mobile communication devices and the technical improvements of location techniques are fostering the development of new applications that use the phys...
Claudio Agostino Ardagna, Marco Cremonini, Sabrina...
PODS
1999
ACM
121views Database» more  PODS 1999»
15 years 1 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...