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

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

Show all versions (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...

Popoln opis

Bibliografske podrobnosti
Main Authors: Ordanel, Ivy D. (Author), Adorna, Henry N. (Author)
Format: Analytics
Jezik:English
Izdano: 2018.
Teme:
Computer science.
Algorithm.
Partial order.
Poset.
Online dostop:https://forms.gle/KZjBv7aRtY6jiL5E9