:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Boileau, Sophie, Hong, Andrew, Liben-Nowell, David, Pattison, Alistair, Rafferty, Anna N., Roslansky, Charlie
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2507.03817
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming
by: Samanta, Sukanya, et al.
Published: (2025)

Exact (n + 2) Comparison Complexity for the N-Repeated Element Problem
by: Au, Andrew
Published: (2026)

Speed Thrills: Visceral Demonstrations That Get Students Excited About Efficient Algorithms
by: Moffat, Alistair, et al.
Published: (2026)

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

The Online Submodular Cover Problem
by: Gupta, Anupam, et al.
Published: (2025)

Learning-Augmented Online Covering Problems
by: Ameli, Afrouz Jabal, et al.
Published: (2025)

Lipschitz Continuous Algorithms for Covering Problems
by: Kumabe, Soh, et al.
Published: (2023)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
by: Madani, Amirali, et al.
Published: (2025)

A Learning Perspective on Random-Order Covering Problems
by: Gupta, Anupam, et al.
Published: (2025)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
by: Buchbinder, Niv, et al.
Published: (2025)

Dynamic Parameterized Feedback Problems in Tournaments
by: Zych-Pawlewicz, Anna, et al.
Published: (2024)

Hardness of Approximation for Shortest Path with Vector Costs
by: Carlson, Charlie, et al.
Published: (2025)

Multipass Linear Sketches for Geometric LP-Type Problems
by: Çekirge, N. Efe, et al.
Published: (2025)

Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons
by: Babatunde, Abiola, et al.
Published: (2026)

A faster algorithm for Vertex Cover parameterized by solution size
by: Harris, David G., et al.
Published: (2022)

On Fine-Grained Distinct Element Estimation
by: Diakonikolas, Ilias, et al.
Published: (2025)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
by: Tayal, Mumuksh
Published: (2025)

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

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)

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)

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

Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems
by: Bernstein, Aaron, et al.
Published: (2025)

Beer Path Problems in Temporal Graphs
by: D'Ascenzo, Andrea, 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)

On the Complexity of the Ordered Covering Problem in Distance Geometry
by: Souza, Michael, et al.
Published: (2025)

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

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

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

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)

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

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

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
by: Cervenjak, Philip, et al.
Published: (2023)

Fair Submodular Maximization over a Knapsack Constraint
by: Li, Lijun, et al.
Published: (2025)