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...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 340; pp. 272 - 285
Main Authors:	Benedito, Marcelo P.L., Pedrosa, Lehilton L.C., Rosado, Hugo K.K.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.12.2023
Subjects:	Approximation Cable-trench Hardness Inapproximability Parameterized algorithm Steiner tree Approximation Parameterized algorithm Hardness Steiner tree Cable-trench Inapproximability
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!