On packing time-respecting arborescences

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization Pub Date : 2022-08-01 DOI:10.1016/j.disopt.2022.100702

Romain Chapoullié , Zoltán Szigeti

引用次数: 0

Abstract

We present a slight generalization of the result of Kamiyama and Kawase (2015) on packing time-respecting arborescences in acyclic pre-flow temporal networks. Our main contribution is to provide the first results on packing time-respecting arborescences in non-acyclic temporal networks. As negative results, we prove the NP-completeness of the decision problem of the existence of 2 arc-disjoint spanning time-respecting arborescences and of a related problem proposed in this paper.

查看原文本刊更多论文

关于包装时间相关乔木

我们提出了Kamiyama和Kawase(2015)关于在无循环预流时间网络中包装时序树的结果的轻微推广。我们的主要贡献是提供了在非无环时间网络中填充时变树形的第一个结果。作为否定结果，我们证明了两个弧不相交的跨时树形的存在性决策问题的np -完备性，以及本文提出的一个相关问题的np -完备性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Optimization 管理科学-应用数学

CiteScore

2.10

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.