License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2019.79
URN: urn:nbn:de:0030-drops-110234
URL: http://drops.dagstuhl.de/opus/volltexte/2019/11023/
Go to the corresponding LIPIcs Volume Portal


Mizuta, Haruka ; Hatanaka, Tatsuhiko ; Ito, Takehiro ; Zhou, Xiao

Reconfiguration of Minimum Steiner Trees via Vertex Exchanges

pdf-format:
LIPIcs-MFCS-2019-79.pdf (0.5 MB)


Abstract

In this paper, we study the problem of deciding if there is a transformation between two given minimum Steiner trees of an unweighted graph such that each transformation step respects a prescribed reconfiguration rule and results in another minimum Steiner tree of the graph. We consider two reconfiguration rules, both of which exchange a single vertex at a time, and generalize the known reconfiguration problem for shortest paths in an unweighted graph. This generalization implies that our problems under both reconfiguration rules are PSPACE-complete for bipartite graphs. We thus study the problems with respect to graph classes, and give some boundaries between the polynomial-time solvable and PSPACE-complete cases.

BibTeX - Entry

@InProceedings{mizuta_et_al:LIPIcs:2019:11023,
  author =	{Haruka Mizuta and Tatsuhiko Hatanaka and Takehiro Ito and Xiao Zhou},
  title =	{{Reconfiguration of Minimum Steiner Trees via Vertex Exchanges}},
  booktitle =	{44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
  pages =	{79:1--79:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-117-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{138},
  editor =	{Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11023},
  URN =		{urn:nbn:de:0030-drops-110234},
  doi =		{10.4230/LIPIcs.MFCS.2019.79},
  annote =	{Keywords: Combinatorial reconfiguration, Graph algorithms, Steiner tree}
}

Keywords: Combinatorial reconfiguration, Graph algorithms, Steiner tree
Seminar: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Issue Date: 2019
Date of publication: 23.08.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI