Two algorithms for the subset interconnection design problem

DOI10.1002/NET.3230220406MaRDI QIDQ4018996zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Approximations for subset interconnection designs
• On complexity of subset interconnection designs
• Steiner problem in networks: A survey
• A special case for subset interconnection designs
• scientific article; zbMATH DE number 3918122

Cited in

(13)

• An optimization problem on graphs
• A 2-approximation algorithm for the network substitution problem
• An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
• Polynomial-time data reduction for the subset interconnection design problem
• Approximations for subset interconnection designs
• A computational study of reduction techniques for the minimum connectivity inference problem
• Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
• Matroids and Subset Interconnection Design
• A special case for subset interconnection designs
• Algorithms and Implementation for Interconnection Graph Problem
• On the complexity of optimal bused interconnections
• The interconnection problem
• Effective and efficient data reduction for the subset interconnection design problem

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

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