Results 31 to 40 of about 925,039 (306)
Dominating Vertex Covers: The Vertex-Edge Domination Problem
Discussiones Mathematicae Graph Theory, 2021 The vertex-edge domination number of a graph, γve(G), is defined to be the cardinality of a smallest set D such that there exists a vertex cover C of G such that each vertex in C is dominated by a vertex in D.
Klostermeyer William F. +2 more
doaj +1 more source
SCMC: An Efficient Scheme for Minimizing Energy in WSNs Using a Set Cover Approach
Future Internet, 2017 Energy-efficient clustering and routing are well known optimization problems in the study of Wireless Sensor Network (WSN) lifetime extension. In this paper, we propose an intelligent hybrid optimization algorithm based on a Set Cover approach to create ...
Ahmed Redha Mahlous
doaj +1 more source
Weighted geometric set cover problems revisited
Journal of Computational Geometry, 2012 We study several set cover problems in low dimensional geometric settings. Specifically, we describe a PTAS for the problem of computing a minimum cover of given points by a set of weighted fat objects.
Sariel Har-Peled, Mira Lee
doaj +1 more source
Hi–C interaction graph analysis reveals the impact of histone modifications in chromatin shape
Applied Network Science, 2021 Chromosome conformation capture experiments such as Hi–C map the three-dimensional spatial organization of genomes in a genome-wide scale. Even though Hi–C interactions are not biased towards any of the histone modifications, previous analysis has ...
Emre Sefer
doaj +1 more source
Parameterized streaming : maximal matching and vertex cover [PDF]
, 2014 As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh; id_orcid +11 more
core +1 more source
UNCERTAINTY ASSESSMENT OF GLOBELAND30 LAND COVER DATA SET OVER CENTRAL ASIA [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2016 GlobeLand30, the world’s first 30m-resolution global land cover data set, has recently been issued for research on global change at a fine resolution. Given the accuracy of GlobeLand30 data may show significant variation in different parts of the world ...
B. Sun +4 more
doaj +1 more source
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem [PDF]
, 2007 The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well- known (and strongly N P -hard) combinatorial optimization problem with many applications.
Kaparis, Konstantinos +2 more
core +1 more source
Domination, Eternal Domination, and Clique Covering
Discussiones Mathematicae Graph Theory, 2015 Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-
Klostermeyer William F., Mynhardt C.M.
doaj +1 more source
Covering Arrays via Set Covers
Electronic Notes in Discrete Mathematics, 2018 Abstract In this paper, we provide yet another construction on how to map problems pertaining covering arrays to specialized set cover problems. With this mapping it is possible to compute optimal covering arrays via minimal solutions of the generated set cover problem.
Ludwig Kampel +2 more
openaire +1 more source
Remarks on Dynamic Monopolies with Given Average Thresholds
Discussiones Mathematicae Graph Theory, 2015 Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and ...
Centeno Carmen C., Rautenbach Dieter
doaj +1 more source