Live briefing
Everything about Maximum coverage problem
Problem in computer science
The maximum coverage problem is a classical question in computer science, computational complexity theory, and operations research. It is a problem that is widely taught in approximation algorithms. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Maximum coverage problemA 5-minute orientation
- Skim a recent paper: Mathematical Models and Nonlinear Optimization in Continuous Maximum Coverage Location ProblemInfluential work since 2022
- Pick up a classic book: Bioinformatics Research and ApplicationsThe most-reprinted book on the subject
- Read the landmark paper: The budgeted maximum coverage problemCited 772 times
- Go sideways: Generalized assignment problemA closely related topic
- Go sideways: Submodular set functionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
The budgeted maximum coverage problem
Maximum coverage capacitated facility location problem with range constrained drones
The Maximum Coverage Location Problem
The Generalized Maximum Coverage Problem
Maximum Target Coverage Problem in Mobile Wireless Sensor Networks
The Budgeted Maximum Coverage Problem in Partially Deployed Software Defined Networks
The maximum vertex coverage problem on bipartite graphs
Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
🆕 Influential since 2022
Mathematical Models and Nonlinear Optimization in Continuous Maximum Coverage Location Problem
An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations
An Efficient Greedy Randomized Heuristic for the Maximum Coverage Facility Location Problem with Drones in Healthcare
Robust Multi-Period Maximum Coverage Drone Facility Location Problem Considering Coverage Reliability
Solving the t -Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling
📚 Books worth reading
Bioinformatics Research and ApplicationsZhipeng Cai · 2013
The Conspirators HierarchyJohn Coleman · 1992
SystemVerilog for VerificationChris Spear · 2006
Empirical LikelihoodArt B. Owen · 2001
Wireless Algorithms, Systems, and ApplicationsKui Ren · 2013
Advances in Wireless Sensor NetworksRuchuan Wang · 2013- 📕Tech15projects.com · 2014
Introduction to making very big booksUnited States. Congress. Senate. Committee on Pensions · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Generalized assignment problem In applied mathematics, the maximum generalized assignment problem is a problem in combinatorial optimization. This problem is a generalization of the…
- Submodular set function In mathematics, a submodular set function (also known as a submodular function) is a set function that, informally, describes the relationship between…
- Set cover problem The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. Given a set of elements {1…
- Linear programming relaxation In mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable.…
- Approximation algorithm In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems…
- Welfare maximization The welfare maximization problem is an optimization problem studied in economics and computer science. Its goal is to partition a set of items among agents…
- Maximum disjoint set In computational geometry, a maximum disjoint set (MDS) is a largest set of non-overlapping geometric shapes selected from a given set of candidate shapes…
- David Shmoys David Bernard Shmoys (born 1959) is a Professor in the School of Operations Research and Information Engineering and the Department of Computer Science…