Multitasking Capacity: Hardness Results and Improved Constructions
arXiv: Data Structures and Algorithms, Volume abs/1809.02835, 2018.
consider the problem of determining the maximal $alpha (0,1]$ such that every matching $M$ of size $k$ (or at most $k$) in a bipartite graph $G$ contains an induced matching of size at least $alpha |M|$. This measure was recently introduced in Alon et al. (NIPS 2018) and is motivated by connectionist models of cognition as well as model...More
Full Text (Upload PDF)
PPT (Upload PPT)