当前位置:
X-MOL 学术
›
Inf. Process. Lett.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A polynomial time algorithm for the 2-Poset Cover Problem
Information Processing Letters ( IF 0.5 ) Pub Date : 2021-02-05 , DOI: 10.1016/j.ipl.2021.106106 Ivy Ordanel , Proceso Fernandez , Henry Adorna
中文翻译:
2极点覆盖问题的多项式时间算法
更新日期:2021-02-09
Information Processing Letters ( IF 0.5 ) Pub Date : 2021-02-05 , DOI: 10.1016/j.ipl.2021.106106 Ivy Ordanel , Proceso Fernandez , Henry Adorna
Given a set ϒ of linear orders, we say that a poset is a halfspace of ϒ if its set of linear extensions and for every and for every . In this paper, we devise an efficient algorithm to expand the halfspace and determine a maximal poset P in ϒ that supercovers it, that is, . Moreover, the said algorithm paves the way for the improvement of the existing exponential running time solution in literature for the 2-Poset Cover Problem to a polynomial running time solution.
中文翻译:
2极点覆盖问题的多项式时间算法
给定一组线性订单,我们说一个 如果是线性扩展集,则为a的半个空格 和 每一个 和 每一个 。在本文中,我们设计了一种有效的算法来扩展半空间并确定pose中的最大位姿P来覆盖半空间,即。此外,所述算法为将文献中的2-Poset覆盖问题的现有指数运行时间解改进为多项式运行时间解铺平了道路。