{"id":"https://openalex.org/W3014010934","doi":"https://doi.org/10.1137/18m1224672","title":"Multitasking Capacity: Hardness Results and Improved Constructions","display_name":"Multitasking Capacity: Hardness Results and Improved Constructions","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3014010934","doi":"https://doi.org/10.1137/18m1224672","mag":"3014010934"},"language":"en","primary_location":{"id":"doi:10.1137/18m1224672","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1224672","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Noga Alon","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088141761","display_name":"Jonathan D. Cohen","orcid":"https://orcid.org/0000-0003-2316-0763"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonathan D. Cohen","raw_affiliation_strings":["Psychology"],"affiliations":[{"raw_affiliation_string":"Psychology","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077079119","display_name":"Thomas L. Griffiths","orcid":"https://orcid.org/0000-0002-5138-7255"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas L Griffiths","raw_affiliation_strings":["Psychology"],"affiliations":[{"raw_affiliation_string":"Psychology","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001520779","display_name":"Pasin Manurangsi","orcid":"https://orcid.org/0000-0002-1052-2801"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pasin Manurangsi","raw_affiliation_strings":["Alphabet Inc"],"affiliations":[{"raw_affiliation_string":"Alphabet Inc","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081855980","display_name":"Daniel Reichman","orcid":"https://orcid.org/0000-0003-0566-7528"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Reichman","raw_affiliation_strings":["Worcester polytechnic Institute"],"affiliations":[{"raw_affiliation_string":"Worcester polytechnic Institute","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028165107","display_name":"Igor Shinkar","orcid":"https://orcid.org/0000-0001-5013-6422"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Igor Shinkar","raw_affiliation_strings":["[Simon Fraser University]"],"affiliations":[{"raw_affiliation_string":"[Simon Fraser University]","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086071515","display_name":"Tal Wagner","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tal Wagner","raw_affiliation_strings":["Massachusetts Institute Of Technology#TAB#"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute Of Technology#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026370019","display_name":"Alexander Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Alexander Yu","raw_affiliation_strings":["Tel Aviv University *"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University *","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":8,"corresponding_author_ids":["https://openalex.org/A5083469386"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2814,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"34","issue":"1","first_page":"885","last_page":"903"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8403440713882446},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8197616338729858},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7699497938156128},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5535799860954285},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5323569774627686},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5060643553733826},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4445537030696869},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.44429752230644226},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4340294897556305},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.37444794178009033},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36565420031547546},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08091932535171509}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8403440713882446},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8197616338729858},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7699497938156128},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5535799860954285},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5323569774627686},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5060643553733826},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4445537030696869},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.44429752230644226},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4340294897556305},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.37444794178009033},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36565420031547546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08091932535171509},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/18m1224672","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1224672","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8043472065","display_name":null,"funder_award_id":"DMS-1855464","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8570908067","display_name":null,"funder_award_id":"2018267","funder_id":"https://openalex.org/F4320308960","funder_display_name":"United States - Israel Binational Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320308960","display_name":"United States - Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1966571632","https://openalex.org/W1986032615","https://openalex.org/W1988449255","https://openalex.org/W1992473680","https://openalex.org/W1999032440","https://openalex.org/W2050035467","https://openalex.org/W2084866560","https://openalex.org/W2086670230","https://openalex.org/W2089247135","https://openalex.org/W2121697407","https://openalex.org/W2122917065","https://openalex.org/W2148190105","https://openalex.org/W2155950671","https://openalex.org/W2156046656","https://openalex.org/W2514739098"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W245205139","https://openalex.org/W2036057584","https://openalex.org/W4301329442","https://openalex.org/W4246000090","https://openalex.org/W2953390393","https://openalex.org/W2107875203","https://openalex.org/W4234658180","https://openalex.org/W4235849992","https://openalex.org/W2910933086"],"abstract_inverted_index":{"We":[0,76,122],"consider":[1,95],"the":[2,6,96,102,167,173,192,220],"problem":[3,177],"of":[4,16,32,129,144,161,194,203,211,224,236],"determining":[5,101],"maximal":[7],"$\\alpha":[8,36],"\\in":[9],"(0,1]$":[10],"such":[11,110],"that":[12,111,158,179],"every":[13,112],"matching":[14,31,99,104,137,176],"$M$":[15],"size":[17,33,212],"$k$":[18],"(or":[19],"at":[20,34],"most":[21],"$k$)":[22],"in":[23,43,62,71,106,115,138],"a":[24,107,124,154,234],"bipartite":[25,139,152,195],"graph":[26,108,232],"$G$":[27,109],"contains":[28],"an":[29,120],"induced":[30],"least":[35],"|M|$.":[37],"This":[38,217],"measure":[39],"was":[40,178],"recently":[41],"introduced":[42],"[N.":[44],"Alon":[45],"et":[46],"al.,":[47],"Adv.":[48],"Neural":[49],"Inf.":[50],"Process.":[51],"Syst.,":[52],"2017,":[53],"pp.":[54],"2097--2106]":[55],"and":[56,73],"is":[57,181],"motivated":[58],"by":[59,68,119],"computational":[60],"models":[61],"cognitive":[63],"neuroscience":[64],"as":[65,67],"well":[66],"modeling":[69],"interference":[70],"radio":[72],"communication":[74],"networks.":[75],"prove":[77,123],"various":[78],"hardness":[79,128,170],"results":[80],"for":[81,135,172,209,230],"computing":[82],"$\\alpha$":[83,227],"either":[84],"exactly":[85],"or":[86],"approximately.":[87],"En":[88],"route":[89],"to":[90,183],"our":[91,165],"results,":[92],"we":[93,150,190],"also":[94],"maximum":[97,174],"connected":[98,118,136,175],"problem:":[100],"largest":[103],"$N$":[105,116],"two":[113],"edges":[114],"are":[117],"edge.":[121],"nearly":[125,218],"optimal":[126],"$n^{1-\\epsilon}$":[127],"approximation":[130],"result":[131,171],"(under":[132],"randomized":[133],"reductions)":[134],"graphs":[140,196],"(with":[141],"both":[142],"sides":[143],"cardinality":[145],"$n$).":[146],"Toward":[147],"this":[148],"end":[149],"define":[151],"half-covers:":[153],"new":[155],"combinatorial":[156],"object":[157],"may":[159],"be":[160],"independent":[162],"interest.":[163],"To":[164],"knowledge,":[166],"best":[168],"previous":[169],"it":[180],"hard":[182],"approximate":[184],"within":[185],"some":[186],"constant":[187],"$\\beta>1$.":[188],"Finally,":[189],"demonstrate":[191],"existence":[193],"with":[197],"$n$":[198],"vertices":[199],"on":[200,226],"each":[201],"side":[202],"average":[204],"degree":[205],"$d$,":[206],"achieving":[207],"$\\alpha=1/2-\\epsilon$":[208],"matchings":[210],"sufficiently":[213],"smaller":[214],"than":[215],"$n/d$.":[216],"matches":[219],"trivial":[221],"upper":[222],"bound":[223],"$1/2$":[225],"which":[228],"holds":[229],"any":[231],"containing":[233],"path":[235],"length":[237],"3.":[238]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}