On Finding Two Posets that Cover Given Linear Orders

• Main Authors: Ordanel, Ivy, Fernandez, Proceso L, Jr, Adorna, Henry
• Format: text
• Published: Archīum Ateneo 2019
• Subjects: partial order; poset; linear extensions; algorithm; complexity; Computer Sciences; Databases and Information Systems; Theory and Algorithms
• Online Access: https://archium.ateneo.edu/discs-faculty-pubs/299; https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1300&context=discs-faculty-pubs
• Institution: Ateneo De Manila University

The Poset Cover Problem is an optimization problem where the goal is to determine a minimum set of posets that covers a given set of linear orders. This problem is relevant in the field of data mining, specifically in determining directed networks or models that explain the ordering of objects in a...