On complexity of subset interconnection designs
From MaRDI portal
Publication:1804586
DOI10.1007/BF01096768zbMATH Open0835.90112OpenAlexW1969940463MaRDI QIDQ1804586FDOQ1804586
Authors: Du Ding-Zhu, 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
Recommendations
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
Cited In (17)
- An optimization problem on graphs
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
- Maximum information stored in a labeled connected network with minimum edges
- Polynomial-time data reduction for the subset interconnection design problem
- Approximations for subset interconnection designs
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- Placing green bridges optimally, with a multivariate analysis
- Matroids and Subset Interconnection Design
- Overlaying a hypergraph with a graph with bounded maximum degree
- A special case for subset interconnection designs
- Title not available (Why is that?)
- Algorithms and Implementation for Interconnection Graph Problem
- Complexity of circuit intersection in graphs
- Two algorithms for the subset interconnection design problem
- Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem
- Effective and efficient data reduction for the subset interconnection design problem
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
This page was built for publication: On complexity of subset interconnection designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804586)
