Searching for authors named "Niv Buchbinder" – sorted by Relevance.
6 documents found, showing 1 through 6.
-
Improved bounds for online routing and packing via a primal-dual approach
- …Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach Niv Buchbinder Computer…
- Cited by 7 (2 self) – Add To MetaCart
-
A primal-dual randomized algorithm for weighted paging
- … (Seffi) Naor ∗ Computer Science Department, Technion, Haifa 32000, Israel. naor@(email omitted); Niv…
- Cited by 1 (0 self) – Add To MetaCart
-
Lower and Upper Bounds on Obtaining History Independence
- …LOWER AND UPPER BOUNDS ON OBTAINING HISTORY INDEPENDENCE NIV BUCHBINDER y AND EREZ PETRANK z…
- Cited by 6 (0 self) – Add To MetaCart
-
A general approach to online network optimization problems
- … † Yossi Azar ‡ Niv Buchbinder § We study a wide range of online graph and network optimization problems…
- Cited by 25 (2 self) – Add To MetaCart
-
An O(log 2 k)-competitive Algorithm for Metric Bipartite Matching
- …An O(log 2 k)-competitive Algorithm for Metric Bipartite Matching Nikhil Bansal 1 , Niv Buchbinder…
- Add To MetaCart
-
The Online Set Cover Problem
- …The Online Set Cover Problem Noga Alon Baruch Awerbuch y Yossi Azar z Niv Buchbinder x…
- Cited by 26 (4 self) – Add To MetaCart
Showing 1 through 6.
