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

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

Toon alle (4) versies

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...

Volledige beschrijving

Bibliografische gegevens
Hoofdauteurs: Ordanel, Ivy D. (Auteur), Adorna, Henry N. (Auteur)
Formaat: Analytics
Taal:English
Gepubliceerd in: 2018.
Onderwerpen:
Computer science.
Algorithm.
Partial order.
Poset.
Online toegang:https://forms.gle/KZjBv7aRtY6jiL5E9