نتایج جستجو برای: set cover problem
تعداد نتایج: 1499858 فیلتر نتایج به سال:
maxsat is an optimization version of SAT capable of expressing a variety of practical problems. maxsat solvers have been designed to take advantage of many of the successful techniques of SAT solvers. However, the most important technique of modern SAT solvers, clause learning, has not been utilized since learnt clauses cannot be soundly added to a maxsat theory. In this paper we present a new ...
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary algorithms. An important subclass of such problems is the implicit set cover (or, equivalently, hitting set) problem in which the sets are not given explicitly but rather defined implicitly. For example, the well-known mi...
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min{cx : x ∈ Z+, Ax ≥ a, Bx ≤ b, x ≤ d}. We give a bicriteria-approximation algorithm that, given ε ∈ (0, 1], finds a solution of cost O(ln(m)/ε) times optimal, meeting the covering constraints (Ax ≥ a) and multiplicity constraints (x ≤ d), and satisfying Bx ≤ (1 + ε)b + β, wher...
We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our problems range from the graph-theoretic (shortest path, vertex cover, facility location) to set-theoretic (set cover, bin packing), and contain representatives with different approximation ratios. The approximation ratio of the s...
Fixed-parameter algorithms and kernelization are two powerful methods to solve NP-hard problems. Yet, so far those algorithms have been largely restricted to static inputs. In this paper we provide fixed-parameter algorithms and kernelizations for fundamental NPhard problems with dynamic inputs. We consider a variety of parameterized graph and hitting set problems which are known to have f(k)n ...
where A is a mxn matrix of zeroes and ones, e = (1,...,1) is a vector of m ones and c is a vector of n (arbitrary) rational components. This pure 0-1 linear programming problem is called the set covering problem. When the inequalities are replaced by equations the problem is called the set partitioning problem, and when all of the ≥ constraints are replaced by ≤ constraints, the problem is call...
Many combinatorial problems, such as bin packing, set covering, and combinatorial design, can be conveniently expressed using set variables and constraints over these variables [3]. In constraint programming such problems can be modeled directly in their natural form by means of set variables. This offers a great potential in exploiting the structure captured by set variables during the solutio...
Motivated by problems such as rectangle stabbing in the plane, we study the minimum hitting set and maximum independent set problems for families of d-intervals and d-union-intervals. We obtain the following: (1) constructions yielding asymptotically tight lower bounds on the integrality gaps of the associated natural linear programming relaxations; (2) an LP-relative dapproximation for the hit...
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its elements (adjacent edges) and the number of available copies of each set (vertex) is bounded. This is a natural generalization of the classical problems that also captures resource limitations in practical scenarios. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید