Some Heuristics for the 2-Poset Cover Problem
Posets are abstract models that may be considered as generating a set of linear orders, which are permutations on some base set. The problem of determining a minimum set of posets that can exactly generate a specified input set of linear orders is referred to as the Poset Cover Problem, and this pro...
Saved in:
Main Authors: | , , |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2014
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/discs-faculty-pubs/82 https://www.researchgate.net/publication/282154675_Some_Heuristics_for_the_2-Poset_Cover_Problem |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Ateneo De Manila University |
成為第一個發表評論!