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

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

Mostra tutte le versioni (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...

Descrizione completa

Dettagli Bibliografici
Autori principali: Ordanel, Ivy D. (Autore), Adorna, Henry N. (Autore)
Natura: Analytics
Lingua:English
Pubblicazione: 2018.
Soggetti:
Computer science.
Algorithm.
Partial order.
Poset.
Accesso online:https://forms.gle/KZjBv7aRtY6jiL5E9