Остановите войну!
for scientists:
default search action
Niv Buchbinder
- > Home > Persons > Niv Buchbinder
Publications
- 2023
- [j30]Niv Buchbinder, Moran Feldman, Mohit Garg:
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. SIAM J. Comput. 52(4): 945-967 (2023) - [i18]Niv Buchbinder, Moran Feldman:
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. CoRR abs/2311.01129 (2023) - 2020
- [j28]Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg:
Online submodular maximization: beating 1/2 made simple. Math. Program. 183(1): 149-169 (2020) - 2019
- [j26]Niv Buchbinder, Moran Feldman:
Constrained Submodular Maximization via a Nonsymmetric Technique. Math. Oper. Res. 44(3): 988-1005 (2019) - [j24]Niv Buchbinder, Moran Feldman, Roy Schwartz:
Online Submodular Maximization with Preemption. ACM Trans. Algorithms 15(3): 30:1-30:31 (2019) - [c42]Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg:
Online Submodular Maximization: Beating 1/2 Made Simple. IPCO 2019: 101-114 - [c40]Niv Buchbinder, Moran Feldman, Mohit Garg:
Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. SODA 2019: 241-254 - 2018
- [j22]Niv Buchbinder, Moran Feldman:
Deterministic Algorithms for Submodular Maximization Problems. ACM Trans. Algorithms 14(3): 32:1-32:20 (2018) - [p1]Niv Buchbinder, Moran Feldman:
Submodular Functions Maximization Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 753-788 - [i12]Niv Buchbinder, Moran Feldman, Mohit Garg:
Online Submodular Maximization: Beating 1/2 Made Simple. CoRR abs/1807.05529 (2018) - [i11]Niv Buchbinder, Moran Feldman, Mohit Garg:
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. CoRR abs/1807.05532 (2018) - 2017
- [j21]Niv Buchbinder, Moran Feldman, Roy Schwartz:
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. Math. Oper. Res. 42(2): 308-329 (2017) - [c38]Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon:
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. SODA 2017: 1235-1244 - [i9]Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon:
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. CoRR abs/1701.01936 (2017) - 2016
- [c34]Niv Buchbinder, Moran Feldman:
Deterministic Algorithms for Submodular Maximization Problems. SODA 2016: 392-403 - [i7]Niv Buchbinder, Moran Feldman:
Constrained Submodular Maximization via a Non-symmetric Technique. CoRR abs/1611.03253 (2016) - 2015
- [j16]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44(5): 1384-1402 (2015) - [c33]Niv Buchbinder, Moran Feldman, Roy Schwartz:
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. SODA 2015: 1149-1168 - [c32]Niv Buchbinder, Moran Feldman, Roy Schwartz:
Online Submodular Maximization with Preemption. SODA 2015: 1202-1216 - [i6]Niv Buchbinder, Moran Feldman, Roy Schwartz:
Online Submodular Maximization with Preemption. CoRR abs/1501.05801 (2015) - [i5]Niv Buchbinder, Moran Feldman:
Deterministic Algorithms for Submodular Maximization Problems. CoRR abs/1508.02157 (2015) - 2014
- [j13]Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency capping in online advertising. J. Sched. 17(4): 385-398 (2014) - [c29]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
Submodular Maximization with Cardinality Constraints. SODA 2014: 1433-1452 - [i4]Niv Buchbinder, Moran Feldman, Roy Schwartz:
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. CoRR abs/1410.0773 (2014) - 2012
- [c27]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS 2012: 649-658 - 2011
- [c22]Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency Capping in Online Advertising. WADS 2011: 147-158
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-07 22:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint