Multitasking Capacity: Hardness Results and Improved Constructions

SIAM JOURNAL ON DISCRETE MATHEMATICS, pp. 885-903, 2020.

Cited by: 0|Views89
EI

Abstract:

We consider the problem of determining the maximal alpha is an element of (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 [N. Alon et al., Adv. Neural Inf. Process. Syst., 2017, pp. 2097-2106] and is motivated b...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments