Optimal deterministic algorithm for the hammock (2,2)-poset cover problem

Optimal deterministic algorithm for the hammock (2,2)-poset cover problem

Visa alla versioner (4)

The Poset Cover Problem is a hard optimization problem that has application to problems in data mining where the goal is to come up with directed acyclic networks that characterize the ordering pattern of a given set of sequential data. There have been variations to the problem, one of which is the...

Full beskrivning

Bibliografiska uppgifter
Huvudupphovsmän: Ordanel, Ivy D. (Författare, medförfattare), Adorna, Henry N. (Författare, medförfattare)
Materialtyp: Analytics
Språk:English
Publicerad: 2018.
Ämnen:
Computer science.
Algorithm.
Partial order.
Poset.
Länkar:https://forms.gle/KZjBv7aRtY6jiL5E9