scientific article; zbMATH DE number 139784

MaRDI QIDQ4028109zbMATH OpenFDO

Authors Edmund Ihler

Publication date 28 March 1993

zbMATH Keywords

approximation algorithmsgroup Steiner problemNP-hardSteiner problemtree

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An improved approximation scheme for the Group Steiner Problem
• scientific article; zbMATH DE number 1303564
• Solving group Steiner problems as Steiner problems.
• A greedy approximation algorithm for the group Steiner problem
• scientific article; zbMATH DE number 219265

Cited in

(11)

• Class Steiner trees and VLSI-design
• The rectilinear class Steiner tree problem for intervals on two parallel lines
• Solving group Steiner problems as Steiner problems.
• Generalized network design problems.
• Blocking for external graph searching
• Approximating fault-tolerant group-Steiner problems
• Approximation algorithm for the group Steiner network problem
• scientific article; zbMATH DE number 219265 (Why is no real title available?)
• General variable neighborhood search approach to group Steiner tree problem
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
• Complexity of the minimum-length corridor problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028109)