On complexity of subset interconnection designs
From MaRDI portal
Publication:1804586
DOI10.1007/BF01096768zbMath0835.90112MaRDI QIDQ1804586
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
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
Related Items
An improved flow-based formulation and reduction principles for the minimum connectivity inference problem, Overlaying a hypergraph with a graph with bounded maximum degree, Maximum information stored in a labeled connected network with minimum edges, Approximations for subset interconnection designs, A special case for subset interconnection designs, Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem, Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
Cites Work