Image de couverture de livre

Maximizing the Margin between Desirable and Undesirable Elements in a Covering Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Boileau, Sophie, Hong, Andrew, Liben-Nowell, David, Pattison, Alistair, Rafferty, Anna N., Roslansky, Charlie
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming
par: Samanta, Sukanya, et autres
Publié: (2025)

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

Speed Thrills: Visceral Demonstrations That Get Students Excited About Efficient Algorithms
par: Moffat, Alistair, et autres
Publié: (2026)

Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
par: Berg, Magnus
Publié: (2024)

The Online Submodular Cover Problem
par: Gupta, Anupam, et autres
Publié: (2025)

Learning-Augmented Online Covering Problems
par: Ameli, Afrouz Jabal, et autres
Publié: (2025)

Lipschitz Continuous Algorithms for Covering Problems
par: Kumabe, Soh, et autres
Publié: (2023)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
par: Madani, Amirali, et autres
Publié: (2025)

A Learning Perspective on Random-Order Covering Problems
par: Gupta, Anupam, et autres
Publié: (2025)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
par: Buchbinder, Niv, et autres
Publié: (2025)

Dynamic Parameterized Feedback Problems in Tournaments
par: Zych-Pawlewicz, Anna, et autres
Publié: (2024)

Multipass Linear Sketches for Geometric LP-Type Problems
par: Çekirge, N. Efe, et autres
Publié: (2025)

Hardness of Approximation for Shortest Path with Vector Costs
par: Carlson, Charlie, et autres
Publié: (2025)

On Fine-Grained Distinct Element Estimation
par: Diakonikolas, Ilias, et autres
Publié: (2025)

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

Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons
par: Babatunde, Abiola, et autres
Publié: (2026)

Maximal Palindromes in MPC: Simple and Optimal
par: Pissis, Solon P.
Publié: (2025)

Submodular Maximization in Exactly $n$ Queries
par: Balkanski, Eric, et autres
Publié: (2024)

Maximizing the Minimum Eigenvalue in Constant Dimension
par: Brown, Adam, et autres
Publié: (2024)

Fair Diversity Maximization with Few Representatives
par: Adriaens, Florian, et autres
Publié: (2025)

Learning-Augmented Dynamic Submodular Maximization
par: Agarwal, Arpit, et autres
Publié: (2023)

Streaming Maximal Matching with Bounded Deletions
par: Khanna, Sanjeev, et autres
Publié: (2025)

A Poisson Process for Submodular Maximization
par: Rozenman, Amit Ganz, et autres
Publié: (2026)

Regularized Unconstrained Weakly Submodular Maximization
par: Zhu, Yanhui, et autres
Publié: (2024)

A faster algorithm for Vertex Cover parameterized by solution size
par: Harris, David G., et autres
Publié: (2022)

Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems
par: Bernstein, Aaron, et autres
Publié: (2025)

Relating Left and Right Extensions of Maximal Repeats
par: Inenaga, Shunsuke, et autres
Publié: (2024)

Maximizing Reachability via Shifting of Temporal Paths
par: Deligkas, Argyrios, et autres
Publié: (2026)

Improved Algorithms for Fair Matroid Submodular Maximization
par: Mahabadi, Sepideh, et autres
Publié: (2026)

Beer Path Problems in Temporal Graphs
par: D'Ascenzo, Andrea, et autres
Publié: (2025)

Advances in Exact and Approximate Group Closeness Centrality Maximization
par: Schulz, Christian, et autres
Publié: (2026)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
par: Armbruster, Alexander, et autres
Publié: (2026)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
par: Bernstein, Aaron, et autres
Publié: (2025)

Subquadratic Submodular Maximization with a General Matroid Constraint
par: Kobayashi, Yusuke, et autres
Publié: (2024)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
par: Zhu, Yanhui, et autres
Publié: (2024)

A Competitive Algorithm for Throughput Maximization on Identical Machines
par: Moseley, Benjamin, et autres
Publié: (2021)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
par: Wan, Zongqi, et autres
Publié: (2024)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
par: Cervenjak, Philip, et autres
Publié: (2023)

Fair Submodular Maximization over a Knapsack Constraint
par: Li, Lijun, et autres
Publié: (2025)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
par: Chen, Wenjing, et autres
Publié: (2023)