Moran Feldman

Ariel Szarf

Algorithmica, April, 2024

Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization.

[BibT_eX]

[DOI]

Loay Mualem

Murad Tukan

CoRR, 2024

Submodular Minimax Optimization: Finding Effective Sets.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid.

[BibT_eX]

[DOI]

Mohit Garg

SIAM J. Comput., August, 2023

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness.

[BibT_eX]

[DOI]

J. ACM, August, 2023

Practical Budgeted Submodular Maximization.

[BibT_eX]

[DOI]

Zeev Nutov

Elad Shoham

Algorithmica, May, 2023

How Do You Want Your Greedy: Simultaneous or Repeated?

[BibT_eX]

[DOI]

Christopher Harshaw

J. Mach. Learn. Res., 2023

Constrained Submodular Maximization via New Bounds for DR-Submodular Functions.

[BibT_eX]

[DOI]

CoRR, 2023

Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets.

[BibT_eX]

[DOI]

Loay Mualem

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint.

[BibT_eX]

[DOI]

Math. Oper. Res., November, 2022

A Framework for the Secretary Problem on the Intersection of Matroids.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

The Power of Subsampling in Submodular Maximization.

[BibT_eX]

[DOI]

Math. Oper. Res., 2022

Correction to: Guess Free Maximization of Submodular and Linear Sums.

[BibT_eX]

[DOI]

Algorithmica, 2022

Using Partial Monotonicity in Submodular Maximization.

[BibT_eX]

[DOI]

Loay Mualem

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Submodular Maximization in Clean Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Streaming Submodular Maximization Under Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Submodular Maximization Subject to Matroid Intersection on the Fly.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case.

[BibT_eX]

[DOI]

Kobi Bodek

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Streaming Submodular Maximization with Matroid and Matching Constraints.

[BibT_eX]

[DOI]

CoRR, 2021

Guess Free Maximization of Submodular and Linear Sums.

[BibT_eX]

[DOI]

Algorithmica, 2021

Submodular + Concave.

[BibT_eX]

[DOI]

Siddharth Mitra

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Regularized Submodular Maximization at Scale.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Distributed Signaling Games.

[BibT_eX]

[DOI]

Omri Weinstein

ACM Trans. Economics and Comput., 2020

Online submodular maximization: beating 1/2 made simple.

[BibT_eX]

[DOI]

Math. Program., 2020

Simultaneous Greedys: A Swiss Army Knife for Constrained Submodular Maximization.

[BibT_eX]

[DOI]

Christopher Harshaw

CoRR, 2020

Continuous Submodular Maximization: Beyond DR-Submodularity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Streaming Submodular Maximization under a k-Set System Constraint.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Algorithms for Big Data

[BibT_eX]

[DOI]

WorldScientific, ISBN: 9789811204753, 2020

2019

Online Submodular Maximization with Preemption.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Constrained Submodular Maximization via a Nonsymmetric Technique.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint.

[BibT_eX]

[DOI]

Naor Alaluf

CoRR, 2019

Almost Optimal Semi-streaming Maximization for k-Extendible Systems.

[BibT_eX]

[DOI]

Ran Haba

CoRR, 2019

Unconstrained submodular maximization with constant adaptive complexity.

[BibT_eX]

[DOI]

Lin Chen

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid.

[BibT_eX]

[DOI]

Mohit Garg

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Adaptive Sequence Submodularity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

Deterministic Algorithms for Submodular Maximization Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

The Submodular Secretary Problem Goes Linear.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 2018

Online Submodular Maximization: Beating 1/2 Made Simple.

[BibT_eX]

[DOI]

Mohit Garg

CoRR, 2018

Removal and Threshold Pricing: Truthful Two-Sided Markets with Multi-dimensional Participants.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Do Less, Get More: Streaming Submodular Maximization with Subsampling.

[BibT_eX]

[DOI]

Ehsan Kazemi

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?

[BibT_eX]

[DOI]

Lin Chen

Proceedings of the 35th International Conference on Machine Learning, 2018

Multi-sided Advertising Markets: Dynamic Mechanisms and Incremental User Compensations.

[BibT_eX]

[DOI]

Gonen Frim

Proceedings of the Decision and Game Theory for Security - 9th International Conference, 2018

Submodularity on Hypergraphs: From Sets to Sequences.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

Submodular Functions Maximization Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Maximizing Symmetric Submodular Functions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Non-preemptive buffer management for latency sensitive packets.

[BibT_eX]

[DOI]

Joseph (Seffi) Naor

J. Sched., 2017

Comparing Apples and Oranges: Query Trade-off in Submodular Maximization.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

O(depth)-Competitive Algorithm for Online Multi-level Aggregation.

[BibT_eX]

[DOI]

CoRR, 2017

Revenue and Reserve Prices in a Probabilistic Single Item Auction.

[BibT_eX]

[DOI]

Noga Alon

Algorithmica, 2017

Building a Good Team: Secretary Problems and the Supermodular Degree.

[BibT_eX]

[DOI]

Rani Izsak

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

O(depth)-Competitive Algorithm for Online Multi-level Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Streaming Weak Submodularity: Interpreting Neural Networks on the Fly.

[BibT_eX]

[DOI]

Ethan R. Elenberg

Alexandros G. Dimakis

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization.

[BibT_eX]

[DOI]

Christopher Harshaw

Proceedings of the 30th Conference on Learning Theory, 2017

2016

Mechanism Design with Strategic Mediators.

[BibT_eX]

[DOI]

Moshe Babaioff

ACM Trans. Economics and Comput., 2016

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Online Truthful Mechanisms for Multi-sided Markets.

[BibT_eX]

[DOI]

CoRR, 2016

Markets with Strategic Multi-minded Mediators.

[BibT_eX]

[DOI]

CoRR, 2016

Constrained Submodular Maximization via a Non-symmetric Technique.

[BibT_eX]

[DOI]

CoRR, 2016

Online Contention Resolution Schemes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Hedonic Clustering Games.

[BibT_eX]

[DOI]

Liane Lewin-Eytan

ACM Trans. Parallel Comput., 2015

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Frequency capping in online advertising.

[BibT_eX]

[DOI]

J. Sched., 2014

Display Advertising with Information Mediators.

[BibT_eX]

[DOI]

Omri Weinstein

CoRR, 2014

A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem.

[BibT_eX]

[DOI]

CoRR, 2014

Submodular Maximization with Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Constrained Monotone Function Maximization and the Supermodular Degree.

[BibT_eX]

[DOI]

Rani Izsak

Proceedings of the Approximation, 2014

2013

Maximization problems with submodular objective functions.

[BibT_eX]

[DOI]

PhD thesis, 2013

Competition in the Presence of Social Networks: How Many Service Providers Maximize Welfare?

[BibT_eX]

[DOI]

Reshef Meir

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012

Improved approximation algorithms for Directed Steiner Forest.

[BibT_eX]

[DOI]

Guy Kortsarz

Zeev Nutov

J. Comput. Syst. Sci., 2012

Interviewing secretaries in parallel.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011

On the Impact of Random Index-Partitioning on Index Compression

[BibT_eX]

[DOI]

CoRR, 2011

Dynamic Multipath Allocation in Ad Hoc Networks.

[BibT_eX]

[DOI]

Yosi Ben-Asher

Sharoni Feldman

Comput. J., 2011

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

A Unified Continuous Greedy Algorithm for Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Improved Approximations for k-Exchange Systems - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Scalability Issues in Ad-Hoc Networks: Metrical Routing Versus Table-Driven Routing.

[BibT_eX]

[DOI]

Wirel. Pers. Commun., 2010

Constructing travel itineraries from tagged geo-temporal breadcrumbs.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on World Wide Web, 2010

Automatic construction of travel itineraries using social breadcrumbs.

[BibT_eX]

[DOI]

Proceedings of the HT'10, 2010

2009

Improved approximating algorithms for Directed Steiner Forest.

[BibT_eX]

[DOI]

Guy Kortsarz

Zeev Nutov

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Distributed Decision and Control for Cooperative UAVs Using Ad Hoc Communication.

[BibT_eX]

[DOI]

IEEE Trans. Control. Syst. Technol., 2008

Hierarchical Task Assignment and Communication Algorithms for Unmanned Aerial Vehicle Flocks.

[BibT_eX]

[DOI]

J. Aerosp. Comput. Inf. Commun., 2008

2007

IFAS: Interactive flexible ad hoc simulator.

[BibT_eX]

[DOI]

Simul. Model. Pract. Theory, 2007

2006

Ad-Hoc Routing Using Virtual Coordinates Based on Rooted Trees.

[BibT_eX]

[DOI]

Yosi Ben-Asher