Performance Analysis of Algorithms for the Steiner Problem in Directed Networks

Abstract

The Steiner problem in directed networks asks for the minimum total weight directed tree spanning a group of nodes of a directed and arc-weighted network. We analize the worst-case performance of several algorithms for this problem and also we discuss the comparability problem between these algorithms. Furthermore, the empirical performance of a proposed… (More)
DOI: 10.1016/j.endm.2004.06.011

Topics

  • Presentations referencing similar topics