scientific article; zbMATH DE number 2230205

zbMath1075.05601MaRDI QIDQ5708491

Alfredo Candia-Véjar, Hugo Bravo-Azlán

Publication date: 18 November 2005

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A series of approximation algorithms for the acyclic directed Steiner tree problem
• A fast algorithm for Steiner trees
• Path-distance heuristic for the Steiner problem in undirected networks
• The Steiner tree problem
• Worst-case performance of some heuristics for Steiner's problem in directed graphs
• Directed Steiner problems with connectivity constraints
• A dual ascent approach for steiner tree problems on a directed graph
• Improved Approximations for the Steiner Tree Problem
• Approximation Algorithms for Directed Steiner Problems
• A lower bound for the steiner tree problem in directed graphs
• Improved algorithms for the Steiner problem in networks
• Unnamed Item

This page was built for publication: