Approximation and computational complexity of some hammock variations of the poset cover problem

Approximation and computational complexity of some hammock variations of the poset cover problem

The Hammock(⏟𝟐𝟐, 𝟐𝟐 , ? , 𝟐𝟐𝒌𝒌 )-Poset Cover Problem is a variation of the Poset Cover Problem with the same input ? set {𝑳𝑳𝟏𝟏, 𝑳𝑳𝟐𝟐, ? , 𝑳𝑳𝒎𝒎} of linear orders over the set {𝟏𝟏, 𝟐𝟐, ? ,𝒏𝒏}, but the solution is restricted to a set of simple hammock (𝟐𝟐⏟, 𝟐𝟐 , ? , 𝟐𝟐𝒌𝒌 ) posets. The problem is NP...

Ausführliche Beschreibung

Bibliographische Detailangaben
Hauptverfasser: Ordanel, Ivy D. (VerfasserIn), Fernandez Jr., Proceso L. (VerfasserIn), Juayong, Richelle Ann B. (VerfasserIn), Adorna, Henry N. (VerfasserIn)
Format: Analytics
Sprache:English
Veröffentlicht: 2020.
Schlagworte:
Algorithm.
Approximation.
Complexity.
Poset.
Online Zugang:https://forms.gle/KZjBv7aRtY6jiL5E9