Erratum to: ``Multitasking capacity: hardness results and improved constructions

DOI10.1137/23M1603856zbMATH Open1541.68151MaRDI QIDQ6572999

Igor Shinkar, Tal Wagner, Noga Alon, Daniel Reichman, Thomas L. Griffiths, Pasin Manurangsi, Jonathan D. Cohen

Publication date: 16 July 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hardness of approximationmultitaskingconnected matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• The probabilistic method
• Multitasking Capacity: Hardness Results and Improved Constructions
• Some optimal inapproximability results

This page was built for publication: Erratum to: ``Multitasking capacity: hardness results and improved constructions

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