Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Buchbinder, Niv
83  Ergebnisse:
Personensuche X
?
1

Constrained Submodular Maximization via New Bounds for DR-S..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Buchbinder, Niv ; Feldman, Moran - p. 1820-1831 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\..:

Buchbinder, Niv ; Feldman, Moran ; Garg, Mohit
SIAM Journal on Computing.  52 (2023)  4 - p. 945-967 , 2023
Link: https://doi.org/10.1137/..
 
?
3

Chasing Positive Bodies:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Bhattacharya, Sayan ; Buchbinder, Niv ; Levin, Roie. - p. 1694-1714 , 2023
Link: https://doi.org/10.1109/..
 
?
4

Online k-taxi via Double Coverage and time-reverse primal-d..:

Buchbinder, Niv ; Coester, Christian ; Naor, Joseph
Mathematical Programming.  197 (2022)  2 - p. 499-527 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Online Virtual Machine Allocation with Lifetime and Load Pr..:

, In: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems,
Buchbinder, Niv ; Fairstein, Yaron ; Mellou, Konstantina.. - p. 9-10 , 2021
Link: https://dl.acm.org/doi/1..
 
?
6

Online k-Taxi via Double Coverage and Time-Reverse Primal-D..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Buchbinder, Niv ; Coester, Christian ; Naor, Joseph (Seffi) - p. 15-29 , 2021
Link: https://doi.org/10.1007/..
 
?
7

Online Virtual Machine Allocation with Lifetime and Load Pr..:

Buchbinder, Niv ; Fairstein, Yaron ; Mellou, Konstantina..
ACM SIGMETRICS Performance Evaluation Review.  49 (2021)  1 - p. 9-10 , 2021
Link: https://doi.org/10.1145/..
 
?
8

Online submodular maximization: beating 1/2 made simple:

Buchbinder, Niv ; Feldman, Moran ; Filmus, Yuval.
Mathematical Programming.  183 (2020)  1-2 - p. 149-169 , 2020
Link: https://doi.org/10.1007/..
 
?
9

Online Submodular Maximization with Preemption:

Buchbinder, Niv ; Feldman, Moran ; Schwartz, Roy
ACM Transactions on Algorithms (TALG).  15 (2019)  3 - p. 1-31 , 2019
Link: https://dl.acm.org/doi/1..
 
?
10

k-servers with a smile : online algorithms via projectio..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Buchbinder, Niv ; Gupta, Anupam ; Molinaro, Marco. - p. 98-116 , 2019
Link: https://dl.acm.org/doi/1..
 
?
11

Deterministic (1/2 + ε)-approximation for submodular maximi..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Buchbinder, Niv ; Feldman, Moran ; Garg, Mohit - p. 241-254 , 2019
Link: https://dl.acm.org/doi/1..
 
?
12

A simple algorithm for the multiway cut problem:

Buchbinder, Niv ; Schwartz, Roy ; Weizman, Baruch
Operations Research Letters.  47 (2019)  6 - p. 587-593 , 2019
Link: https://doi.org/10.1016/..
 
?
13

Online Submodular Maximization: Beating 1/2 Made Simple:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Buchbinder, Niv ; Feldman, Moran ; Filmus, Yuval. - p. 101-114 , 2019
Link: https://doi.org/10.1007/..
 
?
14

Online Submodular Maximization with Preemption:

Buchbinder, Niv ; Feldman, Moran ; Schwartz, Roy
ACM Transactions on Algorithms.  15 (2019)  3 - p. 1-31 , 2019
Link: https://doi.org/10.1145/..
 
?
15

Online Algorithms for Maximum Cardinality Matching with Edg..:

Buchbinder, Niv ; Segev, Danny ; Tkach, Yevgeny
Algorithmica.  81 (2018)  5 - p. 1781-1799 , 2018
Link: https://doi.org/10.1007/..
 
1-15