Submodular maximization with cardinality constraints. Zbl 1423.90212
Buchbinder, Niv; Feldman, Moran; Naor, Joseph (Seffi); Schwartz, Roy |
|
2014
|
A tight linear time (1/2)-approximation for unconstrained submodular maximization. Zbl 1330.68346
Buchbinder, Niv; Feldman, Moran; Seffi, Joseph; Schwartz, Roy |
|
2015
|
Online primal-dual algorithms for maximizing ad-auctions revenue. Zbl 1151.68747
Buchbinder, Niv; Jain, Kamal; Naor, Joseph (Seffi) |
|
2007
|
The online set cover problem. Zbl 1200.68271
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph |
|
2009
|
Online primal-dual algorithms for covering and packing. Zbl 1216.68335
Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2009
|
The design of competitive online algorithms via a primal-dual approach. Zbl 1190.68083
Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2007
|
Online submodular maximization with preemption. Zbl 1371.68328
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy |
|
2015
|
A general approach to online network optimization problems. Zbl 1321.68509
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2006
|
Deterministic algorithms for submodular maximization problems. Zbl 1454.68170
Buchbinder, Niv; Feldman, Moran |
|
2018
|
A primal-dual randomized algorithm for weighted paging. Zbl 1281.68238
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2012
|
A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching. Zbl 1318.68200
Bansal, Nikhil; Buchbinder, Niv; Gupta, Anupam; Naor, Joseph (seffi) |
|
2014
|
A polylogarithmic-competitive algorithm for the \(k\)-server problem (extended abstract). Zbl 1292.68153
Bansal, Nikhil; Buchbinder, Niv; Mądry, Aleksander; Naor, Joseph |
|
2011
|
Deterministic \((\frac12 + \varepsilon)\)-approximation for submodular maximization over a matroid. Zbl 1431.90125
Buchbinder, Niv; Feldman, Moran; Garg, Mohit |
|
2019
|
Constrained submodular maximization via a nonsymmetric technique. Zbl 1434.68674
Buchbinder, Niv; Feldman, Moran |
|
2019
|
Simplex partitioning via exponential clocks and the multiway cut problem. Zbl 1293.05286
Buchbinder, Niv; Naor, Joseph (Seffi); Schwartz, Roy |
|
2013
|
Fair coin flipping: tighter analysis and the many-party case. Zbl 1414.94909
Buchbinder, Niv; Haitner, Iftach; Levi, Nissan; Tsfadia, Eliad |
|
2017
|
Deterministic algorithms for submodular maximization problems. Zbl 1411.68177
Buchbinder, Niv; Feldman, Moran |
|
2016
|
A polylogarithmic-competitive algorithm for the \(k\)-server problem. Zbl 1426.68294
Bansal, Nikhil; Buchbinder, Niv; Madry, Aleksander; Naor, Joseph (Seffi) |
|
2015
|
Comparing apples and oranges: query trade-off in submodular maximization. Zbl 1364.68367
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy |
|
2017
|
Online primal-dual algorithms for covering and packing problems. Zbl 1151.68748
Buchbinder, Niv; Naor, Joseph |
|
2005
|
Simplex transformations and the multiway cut problem. Zbl 1410.05193
Buchbinder, Niv; Schwartz, Roy; Weizman, Baruch |
|
2017
|
Secretary problems via linear programming. Zbl 1305.90344
Buchbinder, Niv; Jain, Kamal; Singh, Mohit |
|
2014
|
Online make-to-order joint replenishment model: primal-dual competitive algorithms. Zbl 1291.90010
Buchbinder, Niv; Kimbrel, Tracy; Levi, Retsef; Makarychev, Konstantin; Sviridenko, Maxim |
|
2013
|
An \(O(\log ^{2} k)\)-competitive algorithm for metric bipartite matching. Zbl 1151.68742
Bansal, Nikhil; Buchbinder, Niv; Gupta, Anupam; Naor, Joseph (Seffi) |
|
2007
|
Randomized competitive algorithms for generalized caching. Zbl 1231.68278
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2008
|
Competitive analysis via regularization. Zbl 1420.68238
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi) |
|
2014
|
\(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation. Zbl 1411.68201
Buchbinder, Niv; Feldman, Moran; Naor, Joseph (Seffi); Talmon, Ohad |
|
2017
|
A general approach to online network optimization problems. Zbl 1318.68199
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2004
|
Unified algorithms for online learning and competitive analysis. Zbl 1335.68196
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi); Shamir, Ohad |
|
2016
|
Online submodular maximization with preemption. Zbl 1453.68216
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy |
|
2019
|
Online make-to-order joint replenishment model: Primal dual competitive algorithms. Zbl 1192.90005
Buchbinder, N.; Kimbrel, T.; Levi, R.; Makarychev, K.; Sviridenko, M. |
|
2008
|
Secretary problems via linear programming. Zbl 1285.90012
Buchbinder, Niv; Jain, Kamal; Singh, Mohit |
|
2010
|
Fair online load balancing. Zbl 1297.68040
Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2013
|
Towards the randomized \(k\)-server conjecture, a primal-dual approach. Zbl 1288.68283
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2010
|
Non-cooperative cost sharing games via subsidies. Zbl 1203.91012
Buchbinder, Niv; Lewin-Eytan, Liane; Naor, Joseph (Seffi); Orda, Ariel |
|
2010
|
Online algorithms for maximum cardinality matching with edge arrivals. Zbl 1422.68321
Buchbinder, Niv; Segev, Danny; Tkach, Yevgeny |
|
2019
|
Online submodular maximization: beating 1/2 made simple. Zbl 1436.90134
Buchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit |
|
2019
|
Online algorithms for maximum cardinality matching with edge arrivals. Zbl 1442.68270
Buchbinder, Niv; Segev, Danny; Tkach, Yevgeny |
|
2017
|
A regularization approach to metrical task systems. Zbl 1306.68211
Abernethy, Jacob; Bartlett, Peter L.; Buchbinder, Niv; Stanton, Isabelle |
|
2010
|
Metrical task systems and the \(k\)-server problem on HSTs. Zbl 1288.68282
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2010
|
Simplex partitioning via exponential clocks and the multiway-cut problem. Zbl 1397.68220
Buchbinder, Niv; Naor, Joseph; Schwartz, Roy |
|
2018
|
\(k\)-servers with a smile: online algorithms via projections. Zbl 1431.68160
Buchbinder, Niv; Gupta, Anupam; Molinaro, Marco; Naor, Joseph (Seffi) |
|
2019
|
Online submodular maximization: beating 1/2 made simple. Zbl 1453.68215
Buchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit |
|
2020
|
Non-cooperative cost sharing games via subsidies. Zbl 1136.91311
Buchbinder, Niv; Lewin-Eytan, Liane; Naor, Joseph (Seffi); Orda, Ariel |
|
2008
|
A simple algorithm for the multiway cut problem. Zbl 1476.90336
Buchbinder, Niv; Schwartz, Roy; Weizman, Baruch |
|
2019
|
Incentive compatible mulit-unit combinatorial auctions: a primal dual approach. Zbl 1311.91109
Buchbinder, Niv; Gonen, Rica |
|
2015
|
Frequency capping in online advertising (extended abstract). Zbl 1342.68361
Buchbinder, Niv; Feldman, Moran; Ghosh, Arpita; Naor, Joseph (Seffi) |
|
2011
|
How to allocate goods in an online market? Zbl 1287.91098
Azar, Yossi; Buchbinder, Niv; Jain, Kamal |
|
2010
|
Approximation algorithms for online weighted rank function maximization under matroid constraints. Zbl 1272.90066
Buchbinder, Niv; Naor, Joseph (Seffi); Ravi, R.; Singh, Mohit |
|
2012
|
Frequency capping in online advertising. Zbl 1305.90242
Buchbinder, Niv; Feldman, Moran; Ghosh, Arpita; Naor, Joseph |
|
2014
|
Competitive algorithms for restricted caching and matroid caching. Zbl 1423.68146
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi) |
|
2014
|
Online \(k\)-taxi via double coverage and time-reverse primal-dual. Zbl 1482.90177
Buchbinder, Niv; Coester, Christian; Naor, Joseph Seffi |
|
2021
|
Lower and upper bounds on obtaining history independence. Zbl 1122.68403
Buchbinder, Niv; Petrank, Erez |
|
2003
|
Online \(k\)-taxi via double coverage and time-reverse primal-dual. Zbl 1482.90177
Buchbinder, Niv; Coester, Christian; Naor, Joseph Seffi |
|
2021
|
Online submodular maximization: beating 1/2 made simple. Zbl 1453.68215
Buchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit |
|
2020
|
Deterministic \((\frac12 + \varepsilon)\)-approximation for submodular maximization over a matroid. Zbl 1431.90125
Buchbinder, Niv; Feldman, Moran; Garg, Mohit |
|
2019
|
Constrained submodular maximization via a nonsymmetric technique. Zbl 1434.68674
Buchbinder, Niv; Feldman, Moran |
|
2019
|
Online submodular maximization with preemption. Zbl 1453.68216
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy |
|
2019
|
Online algorithms for maximum cardinality matching with edge arrivals. Zbl 1422.68321
Buchbinder, Niv; Segev, Danny; Tkach, Yevgeny |
|
2019
|
Online submodular maximization: beating 1/2 made simple. Zbl 1436.90134
Buchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit |
|
2019
|
\(k\)-servers with a smile: online algorithms via projections. Zbl 1431.68160
Buchbinder, Niv; Gupta, Anupam; Molinaro, Marco; Naor, Joseph (Seffi) |
|
2019
|
A simple algorithm for the multiway cut problem. Zbl 1476.90336
Buchbinder, Niv; Schwartz, Roy; Weizman, Baruch |
|
2019
|
Deterministic algorithms for submodular maximization problems. Zbl 1454.68170
Buchbinder, Niv; Feldman, Moran |
|
2018
|
Simplex partitioning via exponential clocks and the multiway-cut problem. Zbl 1397.68220
Buchbinder, Niv; Naor, Joseph; Schwartz, Roy |
|
2018
|
Fair coin flipping: tighter analysis and the many-party case. Zbl 1414.94909
Buchbinder, Niv; Haitner, Iftach; Levi, Nissan; Tsfadia, Eliad |
|
2017
|
Comparing apples and oranges: query trade-off in submodular maximization. Zbl 1364.68367
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy |
|
2017
|
Simplex transformations and the multiway cut problem. Zbl 1410.05193
Buchbinder, Niv; Schwartz, Roy; Weizman, Baruch |
|
2017
|
\(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation. Zbl 1411.68201
Buchbinder, Niv; Feldman, Moran; Naor, Joseph (Seffi); Talmon, Ohad |
|
2017
|
Online algorithms for maximum cardinality matching with edge arrivals. Zbl 1442.68270
Buchbinder, Niv; Segev, Danny; Tkach, Yevgeny |
|
2017
|
Deterministic algorithms for submodular maximization problems. Zbl 1411.68177
Buchbinder, Niv; Feldman, Moran |
|
2016
|
Unified algorithms for online learning and competitive analysis. Zbl 1335.68196
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi); Shamir, Ohad |
|
2016
|
A tight linear time (1/2)-approximation for unconstrained submodular maximization. Zbl 1330.68346
Buchbinder, Niv; Feldman, Moran; Seffi, Joseph; Schwartz, Roy |
|
2015
|
Online submodular maximization with preemption. Zbl 1371.68328
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy |
|
2015
|
A polylogarithmic-competitive algorithm for the \(k\)-server problem. Zbl 1426.68294
Bansal, Nikhil; Buchbinder, Niv; Madry, Aleksander; Naor, Joseph (Seffi) |
|
2015
|
Incentive compatible mulit-unit combinatorial auctions: a primal dual approach. Zbl 1311.91109
Buchbinder, Niv; Gonen, Rica |
|
2015
|
Submodular maximization with cardinality constraints. Zbl 1423.90212
Buchbinder, Niv; Feldman, Moran; Naor, Joseph (Seffi); Schwartz, Roy |
|
2014
|
A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching. Zbl 1318.68200
Bansal, Nikhil; Buchbinder, Niv; Gupta, Anupam; Naor, Joseph (seffi) |
|
2014
|
Secretary problems via linear programming. Zbl 1305.90344
Buchbinder, Niv; Jain, Kamal; Singh, Mohit |
|
2014
|
Competitive analysis via regularization. Zbl 1420.68238
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi) |
|
2014
|
Frequency capping in online advertising. Zbl 1305.90242
Buchbinder, Niv; Feldman, Moran; Ghosh, Arpita; Naor, Joseph |
|
2014
|
Competitive algorithms for restricted caching and matroid caching. Zbl 1423.68146
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi) |
|
2014
|
Simplex partitioning via exponential clocks and the multiway cut problem. Zbl 1293.05286
Buchbinder, Niv; Naor, Joseph (Seffi); Schwartz, Roy |
|
2013
|
Online make-to-order joint replenishment model: primal-dual competitive algorithms. Zbl 1291.90010
Buchbinder, Niv; Kimbrel, Tracy; Levi, Retsef; Makarychev, Konstantin; Sviridenko, Maxim |
|
2013
|
Fair online load balancing. Zbl 1297.68040
Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2013
|
A primal-dual randomized algorithm for weighted paging. Zbl 1281.68238
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2012
|
Approximation algorithms for online weighted rank function maximization under matroid constraints. Zbl 1272.90066
Buchbinder, Niv; Naor, Joseph (Seffi); Ravi, R.; Singh, Mohit |
|
2012
|
A polylogarithmic-competitive algorithm for the \(k\)-server problem (extended abstract). Zbl 1292.68153
Bansal, Nikhil; Buchbinder, Niv; Mądry, Aleksander; Naor, Joseph |
|
2011
|
Frequency capping in online advertising (extended abstract). Zbl 1342.68361
Buchbinder, Niv; Feldman, Moran; Ghosh, Arpita; Naor, Joseph (Seffi) |
|
2011
|
Secretary problems via linear programming. Zbl 1285.90012
Buchbinder, Niv; Jain, Kamal; Singh, Mohit |
|
2010
|
Towards the randomized \(k\)-server conjecture, a primal-dual approach. Zbl 1288.68283
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2010
|
Non-cooperative cost sharing games via subsidies. Zbl 1203.91012
Buchbinder, Niv; Lewin-Eytan, Liane; Naor, Joseph (Seffi); Orda, Ariel |
|
2010
|
A regularization approach to metrical task systems. Zbl 1306.68211
Abernethy, Jacob; Bartlett, Peter L.; Buchbinder, Niv; Stanton, Isabelle |
|
2010
|
Metrical task systems and the \(k\)-server problem on HSTs. Zbl 1288.68282
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2010
|
How to allocate goods in an online market? Zbl 1287.91098
Azar, Yossi; Buchbinder, Niv; Jain, Kamal |
|
2010
|
The online set cover problem. Zbl 1200.68271
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph |
|
2009
|
Online primal-dual algorithms for covering and packing. Zbl 1216.68335
Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2009
|
Randomized competitive algorithms for generalized caching. Zbl 1231.68278
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2008
|
Online make-to-order joint replenishment model: Primal dual competitive algorithms. Zbl 1192.90005
Buchbinder, N.; Kimbrel, T.; Levi, R.; Makarychev, K.; Sviridenko, M. |
|
2008
|
Non-cooperative cost sharing games via subsidies. Zbl 1136.91311
Buchbinder, Niv; Lewin-Eytan, Liane; Naor, Joseph (Seffi); Orda, Ariel |
|
2008
|
Online primal-dual algorithms for maximizing ad-auctions revenue. Zbl 1151.68747
Buchbinder, Niv; Jain, Kamal; Naor, Joseph (Seffi) |
|
2007
|
The design of competitive online algorithms via a primal-dual approach. Zbl 1190.68083
Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2007
|
An \(O(\log ^{2} k)\)-competitive algorithm for metric bipartite matching. Zbl 1151.68742
Bansal, Nikhil; Buchbinder, Niv; Gupta, Anupam; Naor, Joseph (Seffi) |
|
2007
|
A general approach to online network optimization problems. Zbl 1321.68509
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2006
|
Online primal-dual algorithms for covering and packing problems. Zbl 1151.68748
Buchbinder, Niv; Naor, Joseph |
|
2005
|
A general approach to online network optimization problems. Zbl 1318.68199
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph (Seffi) |
|
2004
|
Lower and upper bounds on obtaining history independence. Zbl 1122.68403
Buchbinder, Niv; Petrank, Erez |
|
2003
|