|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| In [[combinatorics]] and [[computer science]], '''covering problems''' are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that.
| | Nice to satisfy you, my name is Refugia. Doing ceramics is what her family and her appreciate. For years he's been operating as a receptionist. Minnesota has usually been his house but his spouse desires them to move.<br><br>my webpage [http://www.white2do.com/index.php?mid=sales2014&order_type=desc&sort_index=regdate&document_srl=533664 home std test] |
| Covering problems are [[Optimization (mathematics)|minimization problem]]s and usually [[linear programs]], whose [[dual problem]]s are called [[packing problem]]s.
| |
| | |
| The most prominent examples of covering problems are the [[set cover problem]], which is equivalent to the [[Hitting set|hitting set problem]], and its special cases, the [[vertex cover problem]] and the [[edge cover problem]].
| |
| | |
| {{Covering-Packing_Problem_Pairs}}
| |
| ==General LP formulation==
| |
| In the context of [[linear programming]], one can think of any linear program as a covering problem if the coefficients in the constraint matrix, the objective function, and right-hand side are nonnegative.<ref>{{harvtxt|Vazirani|2001|p=112}}</ref> More precisely, let us consider the following general [[integer linear program]]:
| |
| {|
| |
| | minimize
| |
| | <math>\sum_{i=1}^n c_i x_i</math>
| |
| |-
| |
| | subject to
| |
| | <math> \sum_{i=1}^n a_{ij} x_i \geq b_j \text{ for }j=1,\dots,m</math>
| |
| |-
| |
| |
| |
| | <math>x_i \geq 0\text{ for }i=1,\dots,n</math>.
| |
| |}
| |
| Such an integer linear program is called '''covering problem''' if <math>a_{ij}, b_j, c_i \geq 0</math> for all <math>i=1,\dots,n</math> and <math>j=1,\dots,m</math>.
| |
| | |
| '''Intuition:''' Assume having <math>n</math> types of object and each object of type <math>i</math> has an associated cost of <math>c_i</math>. The number <math>x_i</math> indicates how many objects of type <math>i</math> we buy. If the constraints <math>A\mathbf{x}\geq \mathbf{b}</math> are satisfied, it is said that ''<math>\mathbf{x}</math> is a covering'' (the structures that are covered depend on the combinatorial context). Finally, an optimal solution to the above integer linear program is a covering of minimal cost.
| |
| | |
| ==Other uses==
| |
| For [[Petri net]]s, for example, the covering problem is defined as the question if for a given marking, there exists a run of the net, such that some larger (or equal) marking can be reached. ''Larger'' means here that all components are at least as large as the ones of the given marking and at least one is properly larger.
| |
| | |
| ==See also==
| |
| * The [[Bipartite dimension|biclique edge cover problem]] asks for covering all edges of a given graph with (as few as possible) [[complete bipartite graph|complete bipartite subgraphs]].
| |
| * [[Disk covering problem]], the problem of covering a unit circle with smaller circles
| |
| | |
| ==Notes==
| |
| {{reflist}}
| |
| | |
| ==References==
| |
| * {{Cite book | last=Vazirani | first=Vijay V. | authorlink=Vijay Vazirani | title=Approximation Algorithms | year=2001 | publisher=Springer-Verlag | isbn=3-540-65367-8 | pages=}}
| |
| | |
| [[Category:Combinatorics]]
| |
| [[Category:Mathematical problems]]
| |
| [[Category:Computational problems]]
| |
Nice to satisfy you, my name is Refugia. Doing ceramics is what her family and her appreciate. For years he's been operating as a receptionist. Minnesota has usually been his house but his spouse desires them to move.
my webpage home std test