Scholarlink

In the two former sections, we introduce the complexity for the decision versions of IDSTP and ADSTP on general digraphs, symmetric digraphs and Eulerian digraphs. The hardness of approximation of ADSTP and IDSTP and their generalizations are also mentioned in Sect. 2.1. In the last section, Sect. 2.3, we introduce three related topics: directed tree connectivity, independent directed Steiner trees and independent branchings, and arc-disjoint in- and out-branchings rooted at the same vertex.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Directed Steiner Tree Packing Problem

  • 章节

  • 发表日期：

    2026年

查看全文
  • Yuefang Sun

摘要

In the two former sections, we introduce the complexity for the decision versions of IDSTP and ADSTP on general digraphs, symmetric digraphs and Eulerian digraphs. The hardness of approximation of ADSTP and IDSTP and their generalizations are also mentioned in Sect. 2.1. In the last section, Sect. 2.3, we introduce three related topics: directed tree connectivity, independent directed Steiner trees and independent branchings, and arc-disjoint in- and out-branchings rooted at the same vertex.