Results 1 to 10 of about 2,701,656 (163)
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 +2 more sources
Approximation Algorithm for the Minimum Hub Cover Set Problem
IEEE Access, 2022 A subset ${\mathcal{ S}}\subseteq V$ of vertices of an undirected graph $G=(V,E)$ is a hub cover when for each edge $(u,v) \in E$ , at least one of its endpoints belongs to ${\mathcal{ S}}$ , or there exists a vertex $r \in {\mathcal{ S}}$ that ...
Joel A. Trejo-Sanchez +3 more
doaj +1 more source
Sensors, 2021 This work is focused on the performance analysis and optimal routing of wireless technology for intelligent energy metering, considering the inclusion of micro grids.
Carlos Suárez, Esteban Inga
doaj +1 more source
Journal of Marine Science and Engineering, 2021 The offshore plant, due to its characteristics, is subject to many restrictions on the material and design of the pipes. Because the design of the firefighting piping depends on the pre-set fire protection design, it is possible to reduce the cost of the
Byeong Cheol Lee +2 more
doaj +1 more source
Mathematics, 2023 Trip recommendation for groups of tourists (TRGT) is a challenging task in tourism since many tourists travel in groups, inducing social interaction and bringing various social benefits.
George Telonis +2 more
doaj +1 more source
The online set cover problem [PDF]
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003 Let X=[1,2,•••,n] be a ground set of n elements, and let S be a family of subsets of X, |S|=m, with a positive cost cS associated with each S ∈ S.Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives elements to the algorithm from X one-by-one. Once a new element is
Noga Alon, Baruch Awerbuch, Yossi Azar
openaire +3 more sources
A simple greedy approximation algorithm for the unit disk cover problem [PDF]
AUT Journal of Mathematics and Computing, 2020 Given a set $\mathcal P$ of $n$ points in the plane, the unit disk cover problem, which is known as an NP-hard problem, seeks to find the minimum number of unit disks that can cover all points of $\mathcal P$. We present a new $4$-approximation algorithm
Mahdi Imanparast, Seyed Naser Hashemi
doaj +1 more source
ALGORITMO DE COBERTURA DE VÉRTICES
Revista Ingeniería, Matemáticas y Ciencias de la Información, 2023 Problem to solve P=NP, using the coverage problem of a graph that is NP and convert it to P. In the mathematicaldiscipline of graph theory, a vertex cover, simply a graph cover, is a set of vertices such that each edge of the graph isincident to at least
Javier López Wong
doaj +1 more source
On the Isometric Path Partition Problem
Discussiones Mathematicae Graph Theory, 2021 The isometric path cover (partition) problem of a graph consists of finding a minimum set of isometric paths which cover (partition) the vertex set of the graph.
Manuel Paul
doaj +1 more source
Solving Set Cover with Pairs Problem using Quantum Annealing [PDF]
, 2016 Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that plays an important role in networking, computational biology, and biochemistry.
Cao, Yudong +3 more
core +3 more sources