The Budgeted Maximum Coverage Problem
- S. Khuller, A. Moss, J. Naor
- Computer ScienceInformation Processing Letters
- 1 April 1999
Small-bias probability spaces: efficient constructions and applications
It is shown how to efficiently construct a small probability space on n binary random variables such that for every subset, its parity is either zero or one with “almost” equal probability. They are…
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Niv Buchbinder, Moran Feldman, J. Naor, Roy Schwartz
- Mathematics, Computer ScienceIEEE Annual Symposium on Foundations of Computer…
- 20 October 2012
This work presents a simple randomized linear time algorithm achieving a tight approximation guarantee of 1/2, thus matching the known hardness result of Feige et al.
The Design of Competitive Online Algorithms via a Primal-Dual Approach
- Niv Buchbinder, J. Naor
- Computer ScienceFoundations and Trends® in Theoretical Computer…
- 11 May 2009
This survey shows in this survey how to extend the primal—dual method to the setting of online algorithms, and shows its applicability to a wide variety of fundamental problems.
Submodular Maximization with Cardinality Constraints
- Niv Buchbinder, Moran Feldman, J. Naor, Roy Schwartz
- Computer ScienceACM-SIAM Symposium on Discrete Algorithms
- 5 January 2014
Improved approximations for two variants of the cardinality constraint for non-monotone functions are presented and a simple randomized greedy approach is presented where in each step a random element is chosen from a set of "reasonably good" elements.
A unified approach to approximating resource allocation and scheduling
- A. Bar-Noy, R. Bar-Yehuda, Ari Freund, J. Naor, B. Schieber
- Computer ScienceJACM
- 1 September 2001
We present a general framework for solving resource allocation and scheduling problems. Given a resource of fixed size, we present algorithms that approximate the maximum throughput or the minimum…
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- Niv Buchbinder, K. Jain, J. Naor
- Computer ScienceEmbedded Systems and Applications
- 8 October 2007
A (1 - 1/e)-competitive (optimal) algorithm is designed for the online ad-auctions problem, which is based on a clean primal-dual approach, matching the competitive factor obtained in Mehta et al.
The competitiveness of on-line assignments
- Y. Azar, J. Naor, R. Rom
- Mathematics, Computer ScienceACM-SIAM Symposium on Discrete Algorithms
- 1 September 1992
It is concluded that for the on-line problem where a number of servers are ready to provide service to a set of customers, randomized algorithms differ from deterministic ones by precisely a constant factor.
The online set cover problem
- N. Alon, B. Awerbuch, Y. Azar, Niv Buchbinder, J. Naor
- Computer ScienceSymposium on the Theory of Computing
- 9 June 2003
An O(log n log m/log log m + log log n) competitive deterministic algorithm for the set cover problem is presented, and a nearly matching lower bound for all interesting values of m and n is established.
A Unified Continuous Greedy Algorithm for Submodular Maximization
- Moran Feldman, J. Naor, Roy Schwartz
- Computer Science, MathematicsIEEE Annual Symposium on Foundations of Computer…
- 22 October 2011
This work presents a new unified continuous greedy algorithm which finds approximate fractional solutions for both the non-monotone and monotone cases, and improves on the approximation ratio for many applications.
...
...