Packing strong subgraph in digraphs

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED Discrete Optimization Pub Date : 2022-11-01 DOI:10.1016/j.disopt.2022.100745

Yuefang Sun , Gregory Gutin , Xiaoyan Zhang

引用次数: 2

Abstract

In this paper, we study two types of strong subgraph packing problems in digraphs, including internally disjoint strong subgraph packing problem and arc-disjoint strong subgraph packing problem. These problems can be viewed as generalizations of the famous Steiner tree packing problem and are closely related to the strong arc decomposition problem. We first prove the NP-completeness for the internally disjoint strong subgraph packing problem restricted to symmetric digraphs and Eulerian digraphs. Then we get inapproximability results for the arc-disjoint strong subgraph packing problem and the internally disjoint strong subgraph packing problem. Finally we study the arc-disjoint strong subgraph packing problem restricted to digraph compositions and obtain some algorithmic results by utilizing the structural properties.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

有向图中强子图的填充

本文研究了有向图中的两类强子图布局问题，即内部不相交强子图布局问题和弧不相交强子图布局问题。这些问题可以看作是著名的斯坦纳树填充问题的推广，并与强弧分解问题密切相关。首先证明了对称有向图和欧拉有向图的内部不相交强子图填充问题的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.

期刊最新文献

Anchor-robust project scheduling with non-availability periods Circuit and Graver walks and linear and integer programming Approximation schemes for Min-Sum k-Clustering Easy and hard separation of sparse and dense odd-set constraints in matching Mostar index and bounded maximum degree