Results 1 to 10 of about 28,710 (123)
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 +4 more sources
The Ground-Set-Cost Budgeted Maximum Coverage Problem [PDF]
Theory of Computing SystemsAbstract 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 ...
Bart De Keijzer, Guido Schäfer
exaly +8 more sources
Online Budgeted Maximum Coverage [PDF]
Algorithmica, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dror Rawitz, Adi Rosen
exaly +4 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 ...
Zequn Wei, Jin-Kao Hao, Kun He
exaly +4 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.
Vahan Mkrtchyan +2 more
exaly +4 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
exaly +2 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
Online Budgeted Maximum Coverage [PDF]
, 2016 We study the Online Budgeted Maximum Coverage (OBMC) problem. Subsets of a weighted ground set U arrive one by one, where each set has a cost. The online algorithm has to select a collection of sets, under the constraint that their cost is at most a ...
Rawitz, Dror
core +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