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

DOI10.1137/23M1603856zbMATH Open1541.68151MaRDI QIDQ6572999FDOQ6572999

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

Publication date: 16 July 2024

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

Recommendations

• Multitasking capacity: hardness results and improved constructions
• scientific article
• On maximum induced matchings in bipartite graphs
• Erratum to: ``Greedy matching: guarantees and limitations
• New results on maximum induced matchings in bipartite graphs and beyond

zbMATH Keywords

hardness of approximationmultitaskingconnected matching

Mathematics Subject Classification ID

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

Cites Work

• Some optimal inapproximability results
• The probabilistic method
• Multitasking capacity: hardness results and improved constructions

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)