On reductions for the Steiner problem in graphs

  • Authors:

  • Jeffrey H. Kingston;Nicholas Paul Sheppard

  • Affiliations:

  • School of Information Technologies, The University of Sydney, Sydney, Australia;School of Information Technology and Computer Science, The University of Wollongong, Australia

  • Venue:
  • Journal of Discrete Algorithms
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.