Work

A linear programming based approach to the Steiner tree problem with a fixed number of terminals

Year: 2019

Type: article

Abstract: We present a set of integer programs (IPs) for the Steiner tree problem with the property that the best solution obtained by solving all IPs provides an optimal Steiner tree. Each IP is polynomial in the size of the underlying graph and our main result is that the linear programming (LP) relaxation of each IP is integral so that it can be solved as a linear program. However, the number of IPs grows exponentially with the number of terminals in the Steiner tree. As a consequence, we are able to solve the Steiner tree problem by solving a polynomial number of LPs, when the number of terminals is fixed.

Source: Networks

DOI: 10.1002/net.21913

Authors: Matias Siebert, Shabbir Ahmed, George Nemhauser

Institution: Georgia Institute of Technology

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Comisión Nacional de Investigación Científica y Tecnológica

Award: G4465799493