{"id":"https://openalex.org/W1831744648","doi":"https://doi.org/10.1145/2898960","title":"Approximating Semi-matchings in Streaming and in Two-Party Communication","display_name":"Approximating Semi-matchings in Streaming and in Two-Party Communication","publication_year":2016,"publication_date":"2016-04-25","ids":{"openalex":"https://openalex.org/W1831744648","doi":"https://doi.org/10.1145/2898960","mag":"1831744648"},"language":"en","primary_location":{"id":"doi:10.1145/2898960","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2898960","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/en/publications/9428b3e2-8036-4ff7-99f9-c8f1ab75cef8","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054336577","display_name":"Christian Konrad","orcid":"https://orcid.org/0000-0003-1802-4011"},"institutions":[{"id":"https://openalex.org/I123185442","display_name":"Reykjav\u00edk University","ror":"https://ror.org/05d2kyx68","country_code":"IS","type":"education","lineage":["https://openalex.org/I123185442"]}],"countries":["IS"],"is_corresponding":true,"raw_author_name":"Christian Konrad","raw_affiliation_strings":["Reykjavik University, School of Computer Science, Reykjavik, Iceland"],"affiliations":[{"raw_affiliation_string":"Reykjavik University, School of Computer Science, Reykjavik, Iceland","institution_ids":["https://openalex.org/I123185442"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110204981","display_name":"Adi Ros\u00e9n","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Adi Ros\u00e9n","raw_affiliation_strings":["CNRS and Universit\u00e9 Paris Diderot, Paris Cedex, France"],"affiliations":[{"raw_affiliation_string":"CNRS and Universit\u00e9 Paris Diderot, Paris Cedex, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054336577"],"corresponding_institution_ids":["https://openalex.org/I123185442"],"apc_list":null,"apc_paid":null,"fwci":0.3619,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.64404621,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"12","issue":"3","first_page":"1","last_page":"21"},"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.9997000098228455,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/bipartite-graph","display_name":"Bipartite graph","score":0.7484554052352905},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7116382122039795},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.669971764087677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6049150228500366},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.5824465155601501},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5458129644393921},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5047193765640259},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.47512155771255493},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4644812047481537},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4520726501941681},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4162241816520691},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37463316321372986},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3391253650188446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3150101602077484},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13679558038711548}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7484554052352905},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7116382122039795},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.669971764087677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6049150228500366},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.5824465155601501},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5458129644393921},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5047193765640259},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.47512155771255493},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4644812047481537},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4520726501941681},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4162241816520691},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37463316321372986},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3391253650188446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3150101602077484},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13679558038711548},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2898960","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2898960","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/9428b3e2-8036-4ff7-99f9-c8f1ab75cef8","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/9428b3e2-8036-4ff7-99f9-c8f1ab75cef8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Konrad, C & Ros\u00e9n, A 2016, 'Approximating Semi-matchings in Streaming and in Two-Party Communication', ACM Transactions on Algorithms, vol. 12, no. 3, 32. https://doi.org/10.1145/2898960","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1304.6906","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1304.6906","pdf_url":"https://arxiv.org/pdf/1304.6906","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/9428b3e2-8036-4ff7-99f9-c8f1ab75cef8","is_oa":false,"landing_page_url":"https://hdl.handle.net/1983/9428b3e2-8036-4ff7-99f9-c8f1ab75cef8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire/9428b3e2-8036-4ff7-99f9-c8f1ab75cef8","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/9428b3e2-8036-4ff7-99f9-c8f1ab75cef8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Konrad, C & Ros\u00e9n, A 2016, 'Approximating Semi-matchings in Streaming and in Two-Party Communication', ACM Transactions on Algorithms, vol. 12, no. 3, 32. https://doi.org/10.1145/2898960","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W175379075","https://openalex.org/W176067329","https://openalex.org/W1530086068","https://openalex.org/W1595640791","https://openalex.org/W1605516979","https://openalex.org/W1612873298","https://openalex.org/W1639030016","https://openalex.org/W1871809785","https://openalex.org/W1967311985","https://openalex.org/W1980375431","https://openalex.org/W2016289973","https://openalex.org/W2029824311","https://openalex.org/W2031612682","https://openalex.org/W2033561606","https://openalex.org/W2044334960","https://openalex.org/W2048652909","https://openalex.org/W2052924791","https://openalex.org/W2058851495","https://openalex.org/W2064467943","https://openalex.org/W2083432171","https://openalex.org/W2091356701","https://openalex.org/W2111874279","https://openalex.org/W2148137544","https://openalex.org/W2242407666","https://openalex.org/W2272441262","https://openalex.org/W2295466155","https://openalex.org/W2410605919","https://openalex.org/W2949284379","https://openalex.org/W2964056228","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W2295466155","https://openalex.org/W4234540089","https://openalex.org/W1629950647","https://openalex.org/W1639030016","https://openalex.org/W4293498213","https://openalex.org/W2963903795","https://openalex.org/W2008470896","https://openalex.org/W2951231217","https://openalex.org/W2186805805","https://openalex.org/W2070751425"],"abstract_inverted_index":{"We":[0,88,174],"study":[1],"the":[2,50,62,74,82,116,140,200],"streaming":[3,93],"complexity":[4,7],"and":[5,108,181,190,207,213],"communication":[6,143,154],"of":[8,36,168,202,235],"approximating":[9],"unweighted":[10],"semi-matchings.":[11],"A":[12,21,31,44,242],"semi-matching":[13,64,117,222,238],"in":[14,67,81],"a":[15,34,90,166,224,232],"bipartite":[16],"graph":[17],"G":[18],"=":[19,29],"(":[20],",":[22,24],"B":[23,47],"E":[25,40],")":[26,123],"with":[27,49,120,134],"n":[28,106,112,122,132,137,160,180,183,189],"|":[30,32],"is":[33,126,231],"subset":[35],"edges":[37,184],"S":[38],"\u2286":[39],"that":[41,95,147,185,219,229,248],"matches":[42],"all":[43],"vertices":[45,48],"to":[46,54,115,128],"goal":[51],"usually":[52],"being":[53],"do":[55,249],"this":[56],"as":[57,59],"fairly":[58],"possible.":[60],"While":[61,215],"term":[63],"was":[65,217],"coined":[66],"2003":[68],"by":[69],"Harvey":[70,203],"et":[71,204],"al.":[72,205],"[2003],":[73],"problem":[75],"had":[76],"already":[77],"previously":[78],"been":[79],"studied":[80],"scheduling":[83],"literature":[84],"under":[85],"different":[86],"names.":[87],"present":[89,175],"deterministic":[91,153,177],"one-pass":[92],"algorithm":[94],"for":[96,148,156,246],"any":[97],"0":[98],"\u2a7d":[99,101],"\u03f5":[100,150],"1":[102],"uses":[103],"space":[104,135],"\u00d5(":[105,136],"1+\u03f5":[107],"computes":[109],"an":[110,130,158,187,191,220,236],"O(":[111,159],"(1\u2212\u03f5)/2":[113],")-approximation":[114,133],"problem.":[118],"Furthermore,":[119],"O(log":[121,131],"passes":[124],"it":[125,216],"possible":[127],"compute":[129,186],").":[138],"In":[139],"one-way":[141],"two-party":[142],"setting,":[144],"we":[145,197,227],"show":[146,228],"every":[149],">":[151],"0,":[152],"protocols":[155,178],"computing":[157],"1/(1+\u03f5)":[161],"c":[162],"+1)":[163],"-approximation":[164],"require":[165],"message":[167],"size":[169],"more":[170],"than":[171],"cn":[172],"bits.":[173],"two":[176],"communicating":[179],"2":[182],"O\u221a":[188],"O(n":[192],"1/3":[193],")-approximation,":[194],"respectively.":[195],"Finally,":[196],"improve":[198],"on":[199],"results":[201],"[2003]":[206],"prove":[208],"new":[209],"links":[210],"between":[211],"semi-matchings":[212,247],"matchings.":[214,241],"known":[218],"optimal":[221,237],"contains":[223],"maximum":[225,240],"matching,":[226],"there":[230],"hierarchical":[233],"decomposition":[234],"into":[239],"similar":[243],"result":[244],"holds":[245],"not":[250],"admit":[251],"length-two":[252],"degree-minimizing":[253],"paths.":[254]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}