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

Descripció completa

Dades bibliogràfiques

Autors principals:	Ordanel, Ivy D. (Autor), Fernandez Jr., Proceso L. (Autor), Juayong, Richelle Ann B. (Autor), Adorna, Henry N. (Autor)
Format:	Analytics
Idioma:	English
Publicat:	2020.
Matèries:	Algorithm. Approximation. Complexity. Poset.
Accés en línia:	https://forms.gle/KZjBv7aRtY6jiL5E9