Using (sub)graphs of small width for solving the Steiner problem

Polzin, Tobias; Vahdati, Siavash

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Using (sub)graphs of small width for solving the Steiner problem

MPS-Authors

/persons/resource/persons45206

Polzin, Tobias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

2002-1-001
(Any fulltext), 10KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Polzin, T., & Vahdati, S.(2002). Using (sub)graphs of small width for solving the Steiner problem (MPI-I-2002-1-001). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-6C9E-5

Abstract

For the Steiner tree problem in networks, we present a practical algorithm that uses the fixed-parameter tractability of the problem with respect to a certain width parameter closely related to pathwidth. The running time of the algorithm is linear in the number of vertices when the pathwidth is constant. Combining this algorithm with our previous techniques, we can already profit from small width in subgraphs of an instance. Integrating this algorithm into our program package for the Steiner problem accelerates the solution process on some groups of instances and leads to a fast solution of some previously unsolved benchmark instances.