Two algorithms for the subset interconnection design problem

DOI10.1002/net.3230220406zbMath0763.90086OpenAlexW1981890243MaRDI QIDQ4018996

Erich Prisner

Publication date: 16 January 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230220406

zbMATH Keywords

minimum spanning treeminimum subset interconnection designNP-complete generalization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

A special case for subset interconnection designs ⋮ A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem ⋮ An improved flow-based formulation and reduction principles for the minimum connectivity inference problem ⋮ Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles ⋮ Approximations for subset interconnection designs

Cites Work

• Unnamed Item

This page was built for publication: Two algorithms for the subset interconnection design problem