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

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

Alle Versionen (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...

Ausführliche Beschreibung

Bibliographische Detailangaben
Hauptverfasser: Ordanel, Ivy D. (VerfasserIn), Adorna, Henry N. (VerfasserIn)
Format: Analytics
Sprache:English
Veröffentlicht: 2018.
Schlagworte:
Computer science.
Algorithm.
Partial order.
Poset.
Online Zugang:https://forms.gle/KZjBv7aRtY6jiL5E9