The class Steiner minimal tree problem: A lower bound and test problem generation

DOI10.1007/S002360000042MaRDI QIDQ1591047zbMATH OpenOpenAlexFDO

Authors Boting Yang, Paul Gillard

Publication date 3 January 2001

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002360000042

zbMATH Keywords

Steiner minimal tree problemvery large scale integration

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Class Steiner trees and VLSI-design
• scientific article; zbMATH DE number 3918122
• An algorithm for the steiner problem in graphs
• A test problem generator for the Steiner problem in graphs
• An SST-based algorithm for the steiner problem in graphs

Cited in

(8)

• Class Steiner trees and VLSI-design
• Generalized network design problems.
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
• Some formulations for the group Steiner tree problem
• A test problem generator for the Steiner problem in graphs
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• scientific article; zbMATH DE number 2230214 (Why is no real title available?)
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm

This page was built for publication: The class Steiner minimal tree problem: A lower bound and test problem generation

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