Results 51 to 60 of about 2,701,676 (183)
An $O(\log n)$-approximation for the Set Cover Problem with Set Ownership [PDF]
, 2008 In highly distributed Internet measurement systems distributed agents periodically measure the Internet using a tool called {\tt traceroute}, which discovers a path in the network graph.
Gonen, Mira, Shavitt, Yuval
core
Approximating the minimum directed tree cover
, 2010 Given a directed graph $G$ with non negative cost on the arcs, a directed tree cover of $G$ is a rooted directed tree such that either head or tail (or both of them) of every arc in $G$ is touched by $T$. The minimum directed tree cover problem (DTCP) is
C. Lund +12 more
core +2 more sources
The covert set-cover problem with application to Network Discovery [PDF]
, 2012 We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain this element as well as query a set to know the elements. We want to find a
Muralidhara, V. N., Sen, Sandeep
core
Target coverage in random wireless sensor networks using cover sets
Journal of King Saud University: Computer and Information Sciences, 2022 There are numerous coverage algorithms which efficiently monitor targets in sensor networks by dividing the sensor network into cover sets where each cover monitors all the targets.
Anvesha Katti
doaj +1 more source
BMC BioinformaticsBackground Metagenomic profiling algorithms commonly rely on genomic differences between lineages, strains, or species to infer the relative abundances of sequences present in a sample.
Jasper van Bemmelen +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
Comments on "Problem Decomposition Method to Compute an Optimal Cover for a Set of Functional Dependencies [PDF]
Database Systems Journal, 2013 Comments on: Vitalie Cotelea, “Problem Decomposition Method to Compute an Optimal Cover for a Set of Functional Dependencies”, Database Systems Journal, 2011, V.2, N 4, pp.17-30.
Xiaoning PENG, Zhijun XIAO
doaj
Sensor placement for fault location identification in water networks: A minimum test cover approach
, 2016 This paper focuses on the optimal sensor placement problem for the identification of pipe failure locations in large-scale urban water systems. The problem involves selecting the minimum number of sensors such that every pipe failure can be uniquely ...
Abbas, Waseem +3 more
core +1 more source
Approximating Node Connectivity Problems via Set Covers
Algorithmica, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kortsarz, Guy, Nutov, Zeev
openaire +1 more source
, 1992 An airline must cover each flight leg with a full complement of cabin crew in a manner consistent with safety regulations and award requirements. Methods are investigated for solving the set partitioning and covering problem.
Mills, G.
core