On the complexity of the Cable-Trench Problem

The Cable-Trench Problem (CTP) is a common generalization of the Single-Source Shortest Paths Problem (SSSP) and the Minimum Spanning Tree Problem (MST): given an edge-weighted graph with a special root vertex and parameters τ,γ≥0, the goal is to find a spanning tree that minimizes the total edge co...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Applied Mathematics Ročník 340; s. 272 - 285
Hlavní autoři: Benedito, Marcelo P.L., Pedrosa, Lehilton L.C., Rosado, Hugo K.K.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 15.12.2023
Témata:
Approximation
Cable-trench
Hardness
Inapproximability
Parameterized algorithm
Steiner tree
Approximation
Parameterized algorithm
Hardness
Steiner tree
Cable-trench
Inapproximability
ISSN:0166-218X, 1872-6771
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Cable-Trench Problem (CTP) is a common generalization of the Single-Source Shortest Paths Problem (SSSP) and the Minimum Spanning Tree Problem (MST): given an edge-weighted graph with a special root vertex and parameters τ,γ≥0, the goal is to find a spanning tree that minimizes the total edge costs plus the total cost of the paths from each vertex to the root, scaled by τ and γ, respectively. While it is well known that both SSSP and MST can be solved in polynomial time, CTP is NP-hard. We show that computing an approximate solution with factor less than 1.000475 is NP-hard, thus ruling out a polynomial-time approximation scheme, unless P=NP. We also consider the more general Steiner Cable-Trench Problem (SCTP), for which only a given subset of terminal vertices must be spanned by a solution. The tree might include non-terminal vertices, known as Steiner vertices, although only paths from terminals to the root are considered in the total cost. For this problem, we present a (2.88+ϵ)-approximation based on a counting argument, for any ϵ>0; also, we give a simple parameterized algorithm with the number of terminals as parameter.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2023.07.010