Covering problems: Difference between revisions

Revision as of 16:12, 29 May 2022

Revision as of 19:50, 31 May 2022

Line 23:

==Kinds of covering problems==

There are various kinds of covering problems in [[graph theory]], [[computational geometry]] and more; see [[:Category:Covering problems]]. Other stochastic related versions of the problem can be found. <ref>{{cite web|author = Douek-Pinkovich, Y., Ben-Gal, I., & Raviv, T. (2022)|format = PDF|title = The Stochastic Test Collection Problem: Models, Exact and Heuristic Solution Approaches ‏|url = http://www.eng.tau.ac.il/~bengal/STCP.pdf|publisher = European Journal of Operational Research, 299 (2022), 945–959} }</ref>

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.