Covering problems: Difference between revisions

Revision as of 17:47, 20 January 2006

Revision as of 14:03, 6 June 2006

Line 3:

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==

See also: [[set cover problem]], [[vertex cover problem]], [[packing problem]].

*[[Set cover problem]]

*[[Vertex cover problem]]

*[[Packing problem]]

[[Category:Combinatorics]]

[[Category:ComputerTheoretical computer science]]