On complexity of subset interconnection designs

DOI10.1007/BF01096768zbMath0835.90112OpenAlexW1969940463MaRDI QIDQ1804586

Ding-Zhu Du, Dean F. Kelley

Publication date: 15 May 1995

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

subset interconnection designs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (7)

A special case for subset interconnection designs ⋮ Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem ⋮ Overlaying a hypergraph with a graph with bounded maximum degree ⋮ Maximum information stored in a labeled connected network with minimum edges ⋮ 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
• Unnamed Item
• An optimization problem on graphs
• On the complexity of an optimal routing tree problem
• Some simplified NP-complete graph problems
• Matroids and Subset Interconnection Design

This page was built for publication: On complexity of subset interconnection designs