Results 11 to 20 of about 2,701,676 (183)
Sensors, 2019 “Vehicular Ad-hoc Networks„ (VANETs): As an active research area in the field of wireless sensor networks, they ensure road safety by exchanging alert messages about unexpected events in a decentralized manner.
S. Kamakshi, V. S. Shankar Sriram
doaj +1 more source
The Angular Set Covering Problem
IEEE Access, 2023 We present an innovative extension of the Set Covering Problem, transitioning from a traditional radial covering to an angular covering structure. The decisions are based on locating the facilities and identifying the directional servers installed in each, covering a set of points in a geographic area.
Fredy Barriga-Gallegos +2 more
openaire +2 more sources
Genetic algorithm efficiency improvement in the course of set cover problem solution
Advanced Engineering Research, 2019 Introduction. Practical tasks (location of service points, creation of microcircuits, scheduling, etc.) often require an exact or approximate to exact solution at a large dimension.
I. S. Konovalov +2 more
doaj +1 more source
Incremental Updating Algorithm for Approximation Sets on Semi-Monolayer Cover Rough Sets [PDF]
Jisuanji gongcheng, 2022 A one-to-one mapping relationship exists between the semi-monolayer cover rough sets and the set-valued information system.When an object set in a set-valued information system is dynamically added or removed, the information unit that corresponds to the
WU Zhengjiang, ZHANG Yaning, ZHANG Zhen, MEI Qiuyu, YANG Tian
doaj +1 more source
Exact and greedy algorithms of allocating experts to maximum set of programmer teams
Системный анализ и прикладная информатика, 2022 The allocation of experts to programmer teams, which meet constraints on professional competences related to programming technologies, languages and tools an IT project specifies is a hard combinatorial problem.
A. A. Prihozhy
doaj +1 more source
Towards Tight Bounds for the Streaming Set Cover Problem [PDF]
, 2016 We consider the classic Set Cover problem in the data stream model. For $n$ elements and $m$ sets ($m\geq n$) we give a $O(1/\delta)$-pass algorithm with a strongly sub-linear $\tilde{O}(mn^{\delta})$ space and logarithmic approximation factor.
Har-Peled, Sariel +3 more
core +1 more source
Greedy Game Algorithms for Solving SET
IEEE Access, 2018 Coverage is a fundamental problem in heterogeneous wireless sensor networks (HWSNs). Lifetime of the HWSNs is another important problem in this area. The K-Cover problem can solve both the coverage and lifetime issues.
Wenjie Yan +3 more
doaj +1 more source
Vertex Cover Gets Faster and Harder on Low Degree Graphs [PDF]
, 2014 The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric objects, often turns
Agrawal, Akanksha +2 more
core +1 more source
IEEE Access, 2022 The Minimum Weighted Connected Vertex Cover problem (MWCVC) is to find a subset $F\subset V(G)$ with minimum weight in a node-weighted graph $G$ , such that when removing the set $F$ , the inducing graph of remaining vertices holds no edges, and the ...
Qipeng Xie +4 more
doaj +1 more source
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
Algorithms, 2018 Let R denote a connected region inside a simple polygon, P. By building barriers (typically straight-line segments) in P \ R
Rolf Klein +2 more
doaj +1 more source