Zobraziť v EDS

A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K4-Minor

Uložené v:

Podrobná bibliografia
Názov:	A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K4-Minor
Autori:	Groenland, Carla, Nederlof, Jesper, Koana, Tomohiro
Informácie o vydavateľovi:	Dagstuhl Publishing, 2024.
Rok vydania:	2024
Predmety:	rooted minor, Steiner tree
Popis:	We study a special case of the Steiner Tree problem in which the input graph does not have a minor model of a complete graph on 4 vertices for which all branch sets contain a terminal. We show that this problem can be solved in O(n4) time, where n denotes the number of vertices in the input graph. This generalizes a seminal paper by Erickson et al. [Math. Oper. Res., 1987] that solves Steiner tree on planar graphs with all terminals on one face in polynomial time.
Druh dokumentu:	Conference object
Jazyk:	English
DOI:	10.4230/lipics.ipec.2024.12
Prístupová URL adresa:	https://research-portal.uu.nl/en/publications/3afb9c5b-eb34-46a1-a489-2deac8de794a
Rights:	CC BY
Prístupové číslo:	edsair.dris...02462..22579604d57756c69294d6c273f5bfa7
Databáza:	OpenAIRE

Popis
Abstrakt:	We study a special case of the Steiner Tree problem in which the input graph does not have a minor model of a complete graph on 4 vertices for which all branch sets contain a terminal. We show that this problem can be solved in O(n4) time, where n denotes the number of vertices in the input graph. This generalizes a seminal paper by Erickson et al. [Math. Oper. Res., 1987] that solves Steiner tree on planar graphs with all terminals on one face in polynomial time.
DOI:	10.4230/lipics.ipec.2024.12