Results 21 to 30 of about 2,701,676 (183)
A Survey on the k-Path Vertex Cover Problem
Axioms, 2022 Given an integer k ≥ 2, a k-path is a path on k vertices. A set of vertices in a graph G is called a k-path vertex cover if it includes at least one vertex of every k-path of G.
Jianhua Tu
doaj +1 more source
Weighted geometric set multi-cover via quasi-uniform sampling
Journal of Computational Geometry, 2016 We give a randomized polynomial time algorithm with approximation ratio $O(\log \phi(n))$ for weighted set multi-cover instances with a shallow cell complexity of at most $f(z,k) =z\phi(z) k^{O(1)}$.
Nikhil Bansal, Kirk Pruhs
doaj +1 more source
Application of genetic algorithm for the set-covering problem solution
Advanced Engineering Research, 2016 The weighed and unweighted minimal set-cover problem, its applicability for the solution of the major optimization practical tasks, such as arrangement of service points, assignment of crews in transport, as well as the integrated-circuit and conveyer ...
Igor S. Konovalov +2 more
doaj +1 more source
Minimization of Boolean functions in the class of orthogonal disjunctive normal forms
Informatika, 2021 The orthogonal disjunctive normal forms (DNFs) of Boolean functions have wide applications in the logical design of discrete devices. The problem of DNF orthogonalization is to get for a given function such a DNF that any two its terms would be ...
Yu. V. Pottosin
doaj +1 more source
The minimum maximal k-partial-matching problem [PDF]
, 2012 In this paper, we introduce a new problem related to bipartite graphs called minimum maximal k-partial-matching (MMKPM) which has been modelled by using a relaxation of the concept of matching in a graph.
García Vargas, Ignacio +1 more
core +1 more source
On Finding Two Posets that Cover Given Linear Orders
Algorithms, 2019 The Poset Cover Problem is an optimization problem where the goal is to determine a minimum set of posets that covers a given set of linear orders. This problem is relevant in the field of data mining, specifically in determining directed networks or ...
Ivy Ordanel +2 more
doaj +1 more source
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers [PDF]
, 2013 In this paper, we study a class of set cover problems that satisfy a special property which we call the {\em small neighborhood cover} property. This class encompasses several well-studied problems including vertex cover, interval cover, bag interval ...
Agarwal, Archita +4 more
core +2 more sources
Mathematics, 2023 A fuzzy graph G is stated to have a set of trees as its tree cover if all the vertices of G are in their union. The maximum weight tree in the tree cover is assumed to be the cost of a tree cover for a fuzzy graph.
Anushree Bhattacharya, Madhumangal Pal
doaj +1 more source
Parameterized Study of the Test Cover Problem [PDF]
, 2012 We carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity.
B.M.E. Moret +9 more
core +1 more source
The minimum-entropy set cover problem
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Halperin, Eran, Karp, Richard M.
openaire +2 more sources