Effective and efficient data reduction for the subset interconnection design problem

DOI10.1007/978-3-642-45030-3_34MaRDI QIDQ2872100zbMATH OpenOpenAlexFDO

Authors Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondřej Suchý, Mathias Weller

Publication date 14 January 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45030-3_34

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Polynomial-time data reduction for the subset interconnection design problem
• On complexity of subset interconnection designs
• The interconnection problem
• Two algorithms for the subset interconnection design problem
• Polynomial-time data reduction for dominating set

Cited in

(3)

• Polynomial-time data reduction for the subset interconnection design problem
• Understanding the effectiveness of data reduction in public transportation networks
• Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances

This page was built for publication: Effective and efficient data reduction for the subset interconnection design problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872100)