Approximations for subset interconnection designs

DOI10.1016/S0304-3975(98)00062-0zbMath0912.68147MaRDI QIDQ1274995

Weili Wu, Xiufeng Du, Dean F. Kelley

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximationperformance ratiosubset interconnection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

3D camera sensor scheduling algorithms for indoor multi-objective tracking

Cites Work

• Unnamed Item
• Unnamed Item
• An optimization problem on graphs
• The Steiner tree problem
• On complexity of subset interconnection designs
• An analysis of the greedy algorithm for the submodular set covering problem
• On the Desirability of Acyclic Database Schemes
• Matroids and Subset Interconnection Design
• Two algorithms for the subset interconnection design problem
• On the hardness of approximating minimization problems

This page was built for publication: Approximations for subset interconnection designs