arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1203.3636cs.DScs.DM
收藏

如何在实践中攻克NP完全DAG实现问题

How to Attack the NP-complete Dag Realization Problem in Practice

Annabell Berger, Matthias Müller-Hannemann

摘要:

我们研究了有向无环图(dags)的以下基本实现问题。给定序列S:=(a_1,b_1),.,(a_n,b_n),其中a_i,b_i在Z_0^+中,是否存在dag(不允许平行弧),其标记顶点集V:= {v_1,.,v_n},使得对于V中的所有v_i,v_i的入度和出度分别与给定的数a_i和b_i完全匹配?最近,Nichterlein(2011)证明了这个决策问题是NP完全的。然而,我们可以证明几类重要的序列是有效可解的。在以前的工作(Berger and Mueller-Hannemann,FCT 2011)中,我们已经证明了yes-实例总是有一种特殊的拓扑序,这使得我们可以在大多数情况下大幅减少可能的拓扑序的数量。这导致了一个精确的指数时间算法,显着提高了一个简单的方法。此外,这种指数时间算法与一种特殊的策略相结合,给出了一个线性时间算法。有趣的是,在系统实验中,我们观察到我们可以通过线性时间启发式解决绝大多数实例。这促使我们开发诸如dag密度和“到可证明容易的序列的距离”之类的特征,这些特征可以给我们一个指标,说明实现给定序列的容易程度或困难程度。此外,我们提出了一个随机算法,利用我们的拓扑排序结构的洞察力,并使用了一些减少规则。我们观察到它明显优于所有其他变体,并且几乎在所有情况下都表现得令人惊讶。另一个引人注目的观察是,我们简单的线性时间算法解决了一组来自不同领域的真实世界的实例,即有序二元决策图(OBDD),训练和航班时刻表,以及来自食物网网络的实例,没有任何例外。

英文摘要:

We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n, b_n) with a_i, b_i in Z_0^+, does there exist a dag (no parallel arcs allowed) with labeled vertex set V:= {v_1,...,v_n} such that for all v_i in V indegree and outdegree of v_i match exactly the given numbers a_i and b_i, respectively? Recently this decision problem has been shown to be NP-complete by Nichterlein (2011). However, we can show that several important classes of sequences are efficiently solvable. In previous work (Berger and Mueller-Hannemann, FCT2011), we have proved that yes-instances always have a special kind of topological order which allows us to reduce the number of possible topological orderings in most cases drastically. This leads to an exact exponential-time algorithm which significantly improves upon a straightforward approach. Moreover, a combination of this exponential-time algorithm with a special strategy gives a linear-time algorithm. Interestingly, in systematic experiments we observed that we could solve a huge majority of all instances by the linear-time heuristic. This motivates us to develop characteristics like dag density and "distance to provably easy sequences" which can give us an indicator how easy or difficult a given sequence can be realized. Furthermore, we propose a randomized algorithm which exploits our structural insight on topological sortings and uses a number of reduction rules. We observe that it clearly outperforms all other variants and behaves surprisingly well for almost all instances. Another striking observation is that our simple linear-time algorithm solves a set of real-world instances from different domains, namely ordered binary decision diagrams (OBDDs), train and flight schedules, as well as instances derived from food-web networks without any exception.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑