Results 1 to 10 of about 24,004 (107)
The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]
Theory Comput SystAbstract We study the following natural variant of the budgeted maximum coverage problem: We are given a budget B and a hypergraph $$G = (V, E)$$ , where each vertex has a non-negative cost ...
van Heuven van Staereling I +2 more
europepmc +15 more sources
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem
International Journal of Computational Intelligence Systems, 2022 We address the Budgeted Maximum Coverage Problem (BMCP), which is a natural and more practical extension of the standard 0–1 knapsack problem and the set cover problem.
Jianrong Zhou, Jiongzhi Zheng, Kun He
doaj +5 more sources
Probability learning based tabu search for the budgeted maximum coverage problem [PDF]
Expert Systems with Applications, 2021 Knapsack problems are classic models that can formulate a wide range of applications. In this work, we deal with the Budgeted Maximum Coverage Problem (BMCP), which is a generalized 0-1 knapsack problem. Given a set of items with nonnegative weights and a set of elements with nonnegative profits, where each item is composed of a subset of elements ...
Liwen Li +3 more
openaire +5 more sources
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs [PDF]
Lecture Notes in Computer Science, 2014 Graphs are often used to model risk management in various systems. Particularly, Caskurlu et al. in [6] have considered a system which essentially represents a tripartite graph. The goal in this model is to reduce the risk in the system below a predefined risk threshold level.
Bugra Çaskurlu +3 more
openaire +5 more sources
Approximations for Restrictions of The Budgeted and Generalized Maximum Coverage Problems
Electronic Notes in Theoretical Computer Science, 2019 Abstract In this paper we present approximation preserving reductions from the Budgeted and Generalized Maximum Coverage Problems to the Knapsack Problem with Conflict Graphs. The reductions are used to yield Polynomial Time Approximation Schemes for special classes of instances of these problems.
Breno Piva
openaire +3 more sources
occams: A Text Summarization Package
Analytics, 2023 Extractive text summarization selects asmall subset of sentences from a document, which gives good “coverage” of a document. When given a set of term weights indicating the importance of the terms, the concept of coverage may be formalized into a ...
Clinton T. White +3 more
doaj +1 more source
The Ground-Set-Cost Budgeted Maximum Coverage Problem [PDF]
, 2016 We study the following natural variant of the budgeted maximum coverage problem: We are given a budget B and a hypergraph G = (V, E), where each vertex has a non-negative cost and a non-negative profit.
Keijzer, Bart +2 more
core +3 more sources
Concept-based Summarization using Integer Linear Programming: From Concept Pruning to Multiple Optimal Solutions [PDF]
, 2015 International audienceIn concept-based summarization, sentence selection is modelled as a budgeted maximum coverage problem. As this problem is NP-hard, pruning low-weight concepts is required for the solver to find optimal solutions efficiently.
Boudin, Florian +2 more
core +4 more sources
Observer Placement for Source Localization: The Effect of Budgets and Transmission Variance [PDF]
, 2016 When an epidemic spreads in a network, a key question is where was its source, i.e., the node that started the epidemic. If we know the time at which various nodes were infected, we can attempt to use this information in order to identify the source ...
Celis, L. Elisa +2 more
core +2 more sources