On the complexity of the Eulerian closed walk with precedence path constraints problem

被引：0
|
作者：
Kerivin, H. L. M. [2 ]
Lacroix, M. [1 ]
Mahjoub, A. R. [1 ]
机构：
[1] Univ Blaise Pascal Clermont Ferrand II, CNRS UMR 6158, LIMOS, F-63177 Aubiere, France
[2] Clemson Univ, Dept Math Sci, Clemson, SC 29634 USA
来源：
THEORETICAL COMPUTER SCIENCE | 2012年 / 439卷
关键词：
Eulerian closed walk; Precedence path constraints; NP-completeness; Polynomial-time algorithm; DELIVERY PROBLEM; PICKUP;
D O I：
10.1016/j.tcs.2012.03.014
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some precedence constraints specified by paths of the digraph, then the problem becomes NP-complete. We also present a polynomial-time algorithm to solve this variant of the Eulerian closed walk problem when the set of paths does not contain some forbidden structure. This allows us to give necessary and sufficient conditions for the existence of feasible solutions in this polynomial-time solvable case. (C) 2012 Published by Elsevier B.V.
引用
收藏
页码：16 / 29
页数：14
相关论文
共 50 条
12345