Search
Search Results
-
Algorithm for Solving the Generalized Set Cover Problem for a Special Class of Problems
To solve the generalized set cover problem, we propose an algorithm consisting of two steps. At the first step, we obtain the cover elements, and, at...
-
Fixed set search applied to the multi-objective minimum weighted vertex cover problem
The Fixed Set Search (FSS) is a novel metaheuristic that adds a learning mechanism to the Greedy Randomized Adaptive Search Procedure (GRASP). In...
-
An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem
We study the online variant of the Min-Sum Set Cover problem (Mssc), a generalization of the well-known list update problem. In the Mssc problem, an...
-
Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
Stochastic combinatorial optimization problems are usually defined as planning problems, which involve purchasing and allocating resources in order...
-
Improved approximation algorithms for some min–max postmen cover problems with applications to the min–max subtree cover
In this paper, we devise improved approximation algorithms for the Min–Max Rural Postmen Cover Problem ( RuralPostCover ) and the Min–Max Chinese...
-
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
In our paper, we consider the following general problems: check feasibility, count the number of feasible solutions, find an optimal solution, and...
-
Cone-Compactness of a Set and Applications to Set-Equilibrium Problems
We study the possibility to get a sequential characterization of the compactness of a set with respect to a cone. Then, we consider some...
-
An Approximation Algorithm for P-prize-collecting Set Cover Problem
In this paper, we consider the P -prize-collecting set cover ( P -PCSC) problem, which is a generalization of the set cover problem. In this problem, we...
-
The Prym Variety of a Dilated Double Cover of Metric Graphs
We calculate the volume of the tropical Prym variety of a harmonic double cover of metric graphs having non-trivial dilation. We show that the...
-
The Best Extending Cover-preserving Geometric Lattices of Semimodular Lattices
In 2010, Gábor Czédli and E. Tamás Schmidt mentioned that the best cover-preserving embedding of a given semimodular lattice is not known yet [A...
-
A new sequential lifting of robust cover inequalities
We propose a new sequential lifting algorithm for robust cover inequalities by extending a recent lifting procedure for the deterministic case. In...
-
Exact Approaches for the Connected Vertex Cover Problem
Given a graph G, the Connected Vertex Cover problem (CVC) asks to find a minimum cardinality vertex cover of G that induces a connected subgraph....
-
-
The Set of Limiting Realizable Values of Topological Entropy of Continuous Map**s of a Cantor Set
AbstractIt is established that in any neighborhood of each continuous map** of a Cantor perfect set there is a map** with a given topological...
-
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
In a sweep cover problem, mobile sensors move around to collect information from positions of interest (PoIs) periodically and timely. A PoI is sweep-covered...
-
The set partitioning problem in a quantum context
The set partitioning problem and its decision variant (i.e., the exact cover problem) are combinatorial optimization problems that were historically...
-
Flexural-Gravity Waves Generated by Different Load Sizes and Configurations on Varying Ice Cover
Three-dimensional nonlinear flexural-gravity waves generated by moving loads on the surface of an ice cover floating upon water of infinite depth are...
-
Above guarantee parameterization for vertex cover on graphs with maximum degree 4
In the vertex cover problem the input is a graph G and an integer k , and the goal is to decide whether there is a set of vertices S of size at most k ...
-
Correction to: Powers of the vertex cover ideals (Collect. Math. 65 (2014) 169–181)
We describe a combinatorial condition on a graphwhich guarantees that all powers of its vertex cover ideal are componentwise linear. Then motivated...