:: Library Catalog

Saved in:

Bibliographic Details
Main Author:	Barbay, Jérémy
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2403.06547
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes
by: Udwani, Rajan
Published: (2024)

Instance-Optimality in PageRank Computation
by: Thorup, Mikkel, et al.
Published: (2025)

Maximal Palindromes in MPC: Simple and Optimal
by: Pissis, Solon P.
Published: (2025)

Unifying Laplace Mechanism with Instance Optimality in Differential Privacy
by: Durfee, David
Published: (2025)

Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation
by: Narayanan, Shyam, et al.
Published: (2024)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
by: Armbruster, Alexander, et al.
Published: (2026)

Instance-Optimal Uniformity Testing and Tracking
by: Blanc, Guy, et al.
Published: (2025)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
by: de Berg, Sarita, et al.
Published: (2026)

Optimal Non-Oblivious Open Addressing
by: Bender, Michael A., et al.
Published: (2025)

Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
by: Chen, Yixin, et al.
Published: (2025)

An Improved Algorithm for Sparse Instances of SAT
by: Jain, Sanjay, et al.
Published: (2024)

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing
by: Larsen, Kasper Green, et al.
Published: (2023)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
by: Jang, Jihoon, et al.
Published: (2025)

Instance-optimal estimation of L2-norm
by: Adar, Tomer
Published: (2026)

Practical Parallel Algorithms for Non-Monotone Submodular Maximization
by: Cui, Shuang, et al.
Published: (2023)

Effective Traveling for Metric Instances of the Traveling Thief Problem
by: Eube, Jan, et al.
Published: (2026)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
by: Chen, Yixin, et al.
Published: (2021)

Submodular Maximization in Exactly $n$ Queries
by: Balkanski, Eric, et al.
Published: (2024)

Maximizing the Minimum Eigenvalue in Constant Dimension
by: Brown, Adam, et al.
Published: (2024)

Regularized Unconstrained Weakly Submodular Maximization
by: Zhu, Yanhui, et al.
Published: (2024)

Fair Diversity Maximization with Few Representatives
by: Adriaens, Florian, et al.
Published: (2025)

Learning-Augmented Dynamic Submodular Maximization
by: Agarwal, Arpit, et al.
Published: (2023)

Streaming Maximal Matching with Bounded Deletions
by: Khanna, Sanjeev, et al.
Published: (2025)

A Poisson Process for Submodular Maximization
by: Rozenman, Amit Ganz, et al.
Published: (2026)

Optimal Non-Adaptive Tolerant Junta Testing via Local Estimators
by: Nadimpalli, Shivam, et al.
Published: (2024)

Deletion Robust Non-Monotone Submodular Maximization over Matroids
by: Dütting, Paul, et al.
Published: (2022)

Generating Satisfiable Benchmark Instances for Stable Roommates Problems with Optimization
by: Yılmaz, Baturay, et al.
Published: (2025)

Relating Left and Right Extensions of Maximal Repeats
by: Inenaga, Shunsuke, et al.
Published: (2024)

Maximizing Reachability via Shifting of Temporal Paths
by: Deligkas, Argyrios, et al.
Published: (2026)

Improved Algorithms for Fair Matroid Submodular Maximization
by: Mahabadi, Sepideh, et al.
Published: (2026)

Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search
by: Brous, Daniel, et al.
Published: (2025)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
by: Goswami, Mayank, et al.
Published: (2022)

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
by: Chen, Yixin, et al.
Published: (2020)

Subquadratic Submodular Maximization with a General Matroid Constraint
by: Kobayashi, Yusuke, et al.
Published: (2024)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
by: Zhu, Yanhui, et al.
Published: (2024)

Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
by: Berg, Magnus
Published: (2024)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
by: Wan, Zongqi, et al.
Published: (2024)

Advances in Exact and Approximate Group Closeness Centrality Maximization
by: Schulz, Christian, et al.
Published: (2026)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
by: Bernstein, Aaron, et al.
Published: (2025)

A Competitive Algorithm for Throughput Maximization on Identical Machines
by: Moseley, Benjamin, et al.
Published: (2021)