Results 21 to 30 of about 925,039 (306)
Dynamic Geometric Set Cover and Hitting Set
ACM Transactions on Algorithms, 2022 We investigate dynamic versions of geometric set cover and hitting set where points and ranges may be inserted or deleted, and we want to efficiently maintain an (approximately) optimal solution for the current problem instance. While their static versions have been extensively studied in the past, surprisingly little is known about ...
Pankaj K. Agarwal +4 more
openaire +4 more sources
On The Study of Edge Monophonic Vertex Covering Number
Ratio Mathematica, 2022 For a connected graph G of order n ≥ 2, a set S of vertices of G is an edge monophonic vertex cover of G if S is both an edge monophonic set and a vertex covering set of G.
K.A Francis Jude Shini +3 more
doaj +1 more source
Verified Approximation Algorithms [PDF]
Logical Methods in Computer Science, 2022 We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing.
Robin Eßmann +3 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,\ldots,n\}$ be a ground set of $n$ elements, and let ${\cal S}$ be a family of subsets of $X$, $|{\cal S}|=m$, with a positive cost $c_S$ associated with each $S\in{\cal S}$. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary.
Noga Alon +4 more
openaire +2 more sources
More dynamic data structures for geometric set cover with sublinear update time
Journal of Computational Geometry, 2022 We study geometric set cover problems in dynamic settings, allowing insertions and deletions of points and objects. We present the first dynamic data structure that can maintain an $O(1)$-approximation in sublinear update time for set cover for axis ...
Timothy Chan, Qizheng He
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
Model Checking Vector Addition Systems with one zero-test [PDF]
Logical Methods in Computer Science, 2012 We design a variation of the Karp-Miller algorithm to compute, in a forward manner, a finite representation of the cover (i.e., the downward closure of the reachability set) of a vector addition system with one zero-test.
Rémi Bonnet +3 more
doaj +1 more source
A Multicast Technique for Fixed and Mobile Optical Wireless Backhaul in 5G Networks
IEEE Access, 2018 The data demand for 5G networks is expected to be much higher than current throughput requirements. To meet this demand, a dense topology of interlinked small cells is needed. Laying new copper and fiber in such a dense network would be cost prohibitive.
Michael Atakora, Harsha Chenji
doaj +1 more source
Crown reductions for the Minimum Weighted Vertex Cover problem [PDF]
, 2004 The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International ...
Chlebikova, Janka +6 more
core +1 more source
Dynamic Geometric Set Cover and Hitting Set [PDF]
, 2020 We investigate dynamic versions of geometric set cover and hitting set where points and ranges may be inserted or deleted, and we want to efficiently maintain an (approximately) optimal solution for the current problem instance.
Chang, Hsien-Chih +4 more
core +1 more source