Cover Image

Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Samanta, Sukanya, Kalathoti, Abhi Rohit, Gonchi, Siva Jayanth, Adiraju, Venkata Krishna Kashyap, Nettem, Sai Kiran
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Dynamic Programming Approach to Evader Pathfinding in Static Pursuit Scenarios
by: Samanta, Sukanya, et al.
Published: (2025)

Structural Parameterization of Locating-Dominating Set and Test Cover
by: Chakraborty, Dipayan, et al.
Published: (2024)

Maximizing the Margin between Desirable and Undesirable Elements in a Covering Problem
by: Boileau, Sophie, et al.
Published: (2025)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
by: D'Angelo, Gianlorenzo, et al.
Published: (2025)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
by: Chakraborty, Dipayan, et al.
Published: (2024)

Dominating Set with Quotas: Balancing Coverage and Constraints
by: Chatterjee, Sobyasachi, et al.
Published: (2026)

Minmax-Regret $k$-Sink Location on a Dynamic Tree Network with Uniform Capacities
by: Golin, Mordecai J., et al.
Published: (2018)

Fair Set Cover
by: Dehghankar, Mohsen, et al.
Published: (2024)

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

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
by: Zhao, Jingyang, et al.
Published: (2025)

Sublinear Metric Steiner Forest via Maximal Independent Set
by: Mahabadi, Sepideh, et al.
Published: (2025)

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

Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
by: Saito, Rin, et al.
Published: (2025)

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

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
by: Herrmann, Anton, et al.
Published: (2025)

Maximum Coverage $k$-Antichains and Chains: A Greedy Approach
by: Cáceres, Manuel, et al.
Published: (2025)

Algorithms for Halfplane Coverage and Related Problems
by: Wang, Haitao, et al.
Published: (2024)

Dynamic Set Cover with Worst-Case Recourse
by: Solomon, Shay, et al.
Published: (2025)

Min-Sum Set Cover on Parallel Machines
by: Szyfelbein, Michał
Published: (2026)

Engineering Algorithms for Dynamic Greedy Set Cover
by: Uzrad, Amitai
Published: (2026)

Dynamic Pricing Algorithms for Online Set Cover
by: Bender, Max, et al.
Published: (2024)

Online Disjoint Set Covers: Randomization is not Necessary
by: Bienkowski, Marcin, et al.
Published: (2024)

Random Order Set Cover is as Easy as Offline
by: Gupta, Anupam, et al.
Published: (2021)

Knapsack with Vertex Cover, Set Cover, and Hitting Set
by: Dey, Palash, et al.
Published: (2024)

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

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
by: Hamm, Thekla, et al.
Published: (2026)

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)

A Lossless Deamortization for Dynamic Greedy Set Cover
by: Solomon, Shay, et al.
Published: (2024)

Enumeration kernels for Vertex Cover and Feedback Vertex Set
by: Bougeret, Marin, et al.
Published: (2025)

Online Rounding for Set Cover under Subset Arrivals
by: Byrka, Jarosław, et al.
Published: (2025)

Fine-Grained Privacy Guarantees for Coverage Problems
by: Dhulipala, Laxman, et al.
Published: (2024)

Accelerated Relax-and-Round for Concave Coverage Problems
by: Fahrbach, Matthew, et al.
Published: (2026)

Dynamic $((1+ε)\ln n)$-Approximation Algorithms for Minimum Set Cover and Dominating Set
by: Solomon, Shay, et al.
Published: (2023)

Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts
by: Fischer, Nick, et al.
Published: (2026)

Variations on the Problem of Identifying Spectrum-Preserving String Sets
by: Chakraborty, Sankardeep, et al.
Published: (2026)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
by: Eiben, Eduard, et al.
Published: (2024)

On the Line-Separable Unit-Disk Coverage and Related Problems
by: Liu, Gang, 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)