On reductions for the Steiner Problem in Graphs

https://doi.org/10.1016/S1570-8667(03)00008-XGet rights and content
Under an Elsevier user license
open archive

Abstract

Several authors have demonstrated how reductions can be used to improve the efficiency with which the Steiner Problem in Graphs can be solved. Previous reduction algorithms have been largely ad hoc in nature. This paper uses a theory of confluence to show that, in many cases, all maximal reduction sequences are equivalent, gaining insights into the design of reduction algorithms that obtain a maximum degree of reduction.

Keywords

Reduction
Steiner problem

Cited by (0)