最小等价优先关系系统
Minimum Equivalent Precedence Relation Systems
摘要:
本文考虑了描述优先关系系统的线性不等式组的两个相关的简化问题。给定一个优先关系系统,第一个问题寻找优先关系的最小子集(即,不等式),其具有与原始系统相同的解集。第二个问题与第一个问题相同,只是第一个问题中的“子集限制”被删除了。本文证明了第一个问题是NP难的。然而,提供了一个充分条件下,第一个问题是可解的多项式时间。此外,第一个问题分解成独立的易处理和棘手的子问题。第二个问题被证明是可解的多项式时间,与一个完整的参数化的所有解决方案。本文推广了[Moyles and Thompson 1969,Aho,Garey,and Ullman 1972]中关于最小等价图问题和传递约简问题的结果,这些结果适用于无权有向图.
英文摘要:
In this paper two related simplification problems for systems of linear inequalities describing precedence relation systems are considered. Given a precedence relation system, the first problem seeks a minimum subset of the precedence relations (i.e., inequalities) which has the same solution set as that of the original system. The second problem is the same as the first one except that the ``subset restriction'' in the first problem is removed. This paper establishes that the first problem is NP-hard. However, a sufficient condition is provided under which the first problem is solvable in polynomial-time. In addition, a decomposition of the first problem into independent tractable and intractable subproblems is derived. The second problem is shown to be solvable in polynomial-time, with a full parameterization of all solutions described. The results in this paper generalize those in [Moyles and Thompson 1969, Aho, Garey, and Ullman 1972] for the minimum equivalent graph problem and transitive reduction problem, which are applicable to unweighted directed graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。