Results 211 to 220 of about 89,468 (247)
Some of the next articles are maybe not open access.
The Budgeted Maximum Coverage Problem in Partially Deployed Software Defined Networks
IEEE Transactions on Network and Service Management, 2016Due to the large installed base of distributed legacy networks, software defined networking (SDN) nodes may be required to coexist with legacy nodes to form hybrid networks. It has been shown that such a hybrid network has better performance than a pure legacy network due to smarter transmission scheduling.
Binayak Kar +2 more
exaly +3 more sources
A budgeted maximum multiple coverage model for cybersecurity planning and management
IISE Transactions, 2019AbstractThis article studies how to identify strategies for mitigating cyber-infrastructure vulnerabilities.
Laura A McLay +2 more
exaly +3 more sources
A PTAS for the budgeted power maximum coverage problem
Theoretical Computer ScienceYingli Ran
exaly +3 more sources
Solving the Holed Space Budgeted Maximum Coverage Problem with a Discrete Selection Problem
Proceedings of the 21st International Conference on Informatics in Control, Automation and Robotics: In this paper, a new heuristic for the budgeted maximum coverage problem is introduced for environments that include obstacles (holed space). This heuristic leads to a solvable but NP-hard problem which requires a series of discrete decisions to be ...
Mohammad Zamani
exaly +3 more sources
Budgeted Maximum Coverage with Overlapping Costs: Monitoring the Emerging Infections Network
Workshop on Algorithm Engineering and Experimentation, 2010Sriram V Pemmaraju, Philip M Polgreen
exaly +3 more sources
Balanced Local Search for the Set-Union Knapsack Problem and Budgeted Maximum Coverage Problem
Social Science Research Network, 2023Wenli Zhu, Liangqing Luo
openaire +2 more sources
The Multi-budget Maximum Weighted Coverage Problem
2021In this paper we consider the multi-budget maximum weighted coverage problem, a generalization of the classical maximum coverage problem, where we are given k budgets, a set X of elements, and a set S of bins where any S∈S is a subset of elements of X. Each bin S has its own cost, and each element its own weight.
Francesco Cellinese +3 more
openaire +2 more sources
The Generalized Maximum Coverage Problem
Information Processing Letters, 2008 Reuven Cohen, Liran katzir
exaly +2 more sources
Maximum coverage problem with group budget constraints
Journal of Combinatorial Optimization, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boaz Farbstein, Asaf Levin
openaire +2 more sources
Efficient approximation algorithms for maximum coverage with group budget constraints
Theoretical Computer Science, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Longkun Guo, Min Li 0028, Dachuan Xu
openaire +1 more source