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...
| প্রধান লেখক: | , , , |
|---|---|
| বিন্যাস: | Analytics |
| ভাষা: | ইংরেজি |
| প্রকাশিত: |
2020.
|
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | https://forms.gle/KZjBv7aRtY6jiL5E9 |