On complexity of subset interconnection designs

DOI10.1007/BF01096768zbMATH Open0835.90112OpenAlexW1969940463MaRDI QIDQ1804586FDOQ1804586

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

zbMATH Keywords

subset interconnection designs

Mathematics Subject Classification ID

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

Cites Work

• Some simplified NP-complete graph problems
• An optimization problem on graphs
• On the complexity of an optimal routing tree problem
• Matroids and Subset Interconnection Design
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• 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
• 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
• Overlaying a hypergraph with a graph with bounded maximum degree
• A special case for subset interconnection designs
• Complexity of circuit intersection in graphs
• Two algorithms 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)