Back to Search
Start Over
ERRATUM: MULTITASKING CAPACITY: HARDNESS RESULTS AND IMPROVED CONSTRUCTIONS.
- Source :
-
SIAM Journal on Discrete Mathematics . 2024, Vol. 38 Issue 2, p2001-2003. 3p. - Publication Year :
- 2024
-
Abstract
- We correct an error in the appendix of [N. Alon et al., SIAM J. Discrete Math., 34 (2020), pp. 885-903] and prove that it is NP-hard to approximate the size of a maximum induced matching of a bipartite graph within any constant factor. [ABSTRACT FROM AUTHOR]
- Subjects :
- *BIPARTITE graphs
Subjects
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 38
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 178602115
- Full Text :
- https://doi.org/10.1137/23M1603856