Results 31 to 40 of about 2,701,676 (183)
The Online Disjoint Set Cover Problem and its Applications
, 2014 Given a universe $U$ of $n$ elements and a collection of subsets $\mathcal{S}$ of $U$, the maximum disjoint set cover problem (DSCP) is to partition $\mathcal{S}$ into as many set covers as possible, where a set cover is defined as a collection of ...
Bagaria, Vivek Kumar +2 more
core +1 more source
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Zhao, Gao, Xiaofeng, Wu, Weili
openaire +1 more source
Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets
IEEE Access, 2018 The minimum vertex cover problem is a well-known optimization problem; it has been used in a wide variety of applications. This paper focuses on rough set-based approach for the minimum vertex cover problem of the dynamic and static hypergraphs.
Qian Zhou, Xiaolin Qin, Xiaojun Xie
doaj +1 more source
A note on the generalized min-sum set cover problem
, 2011 In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin. Bansal, Gupta, and Krishnaswamy give a 485-approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-
Skutella, Martin, Williamson, David P.
core +1 more source
The dynamic set covering próblem
Applied Mathematical Modelling, 1982 This paper addresses a dynamic version of the set covering formulation for facility location problems. The problem is characterized by 0–1 cover coefficients that may change value from one time period to the next. Included is a discussion of model formulation considerations, solution procedures and applications areas.
Chrissis, James W. +2 more
openaire +1 more source
Proficient QoS-Based Target Coverage Problem in Wireless Sensor Networks
IEEE Access, 2020 Assuring the coverage towards the predefined set of targets, power-constrained wireless sensor networks (WSNs) consist of sensing devices (i.e., sensor nodes) that are associated with limited battery life and fixed sensing range.
Manju +5 more
doaj +1 more source
Adversarial subdomain adaptation network for mismatched steganalysis
网络与信息安全学报, 2022 Once data in the training and test sets come from different cover sources, that is, under the condition of cover source mismatch, it usually makes the detection accuracy rate of an outstanding steganalysis model to be reduced.In practical applications ...
Lei ZHANG, Hongxia WANG
doaj +3 more sources
Journal of Computational Geometry, 2012 We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by a set of other geometric objects called cover (e.g., a set of disks or homothetic triangles).
Nieves Atienza +13 more
doaj +1 more source
IEEE Access, 2020 Sleep scheduling is an effective mechanism to extend the lifetime of energy-constrained Wireless Sensor Networks(WSNs). It is often that the sensors are divided into sets with some constraints after plentiful sensors are deployed randomly, and then the ...
Jingjing Li, Zhipeng Luo, Jing Xiao
doaj +1 more source
Simultaneously dominating all spanning trees of a graph
Electronic Journal of Graph Theory and Applications, 2022 We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann +2 more
doaj +1 more source