{"id":"https://openalex.org/W2942921462","doi":"https://doi.org/10.1137/17m1126795","title":"An Algorithm for Koml\u00f3s Conjecture Matching Banaszczyk's Bound","display_name":"An Algorithm for Koml\u00f3s Conjecture Matching Banaszczyk's Bound","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2942921462","doi":"https://doi.org/10.1137/17m1126795","mag":"2942921462"},"language":"en","primary_location":{"id":"doi:10.1137/17m1126795","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1126795","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/bd2e1f9a-3d28-42c1-991c-b7ea5436a0ed","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Nether-lands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Nether-lands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044591096","display_name":"Daniel Dadush","orcid":"https://orcid.org/0000-0001-5577-5012"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Daniel Dadush","raw_affiliation_strings":["Centrum Wiskunde & Informatica, Amsterdam"],"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica, Amsterdam","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114033528","display_name":"Shashwat Garg","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Shashwat Garg","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Nether-lands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Nether-lands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":4.544,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.95417082,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"48","issue":"2","first_page":"534","last_page":"553"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.989799976348877,"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/T11720","display_name":"Probability and Risk Models","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7563614249229431},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6602468490600586},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6120322942733765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.591009259223938},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5453665852546692},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5250632166862488},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46602392196655273},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3999972641468048},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36066365242004395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20361873507499695}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7563614249229431},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6602468490600586},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6120322942733765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.591009259223938},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5453665852546692},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5250632166862488},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46602392196655273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3999972641468048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36066365242004395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20361873507499695},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/17m1126795","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1126795","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/bd2e1f9a-3d28-42c1-991c-b7ea5436a0ed","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/bd2e1f9a-3d28-42c1-991c-b7ea5436a0ed","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Bansal, N, Dadush, D & Garg, S 2019, 'An algorithm for koml\u00f3s conjecture matching Banaszczyk's bound', SIAM Journal on Computing, vol. 48, no. 2, pp. 534-553. https://doi.org/10.1137/17M1126795","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:cwi.nl:28676","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/28676","pdf_url":"https://ir.cwi.nl/pub/28676/28676.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing vol. 48 no. 2, pp. 534-553","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/bd2e1f9a-3d28-42c1-991c-b7ea5436a0ed","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/bd2e1f9a-3d28-42c1-991c-b7ea5436a0ed","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 48(2), 534 - 553. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/bd2e1f9a-3d28-42c1-991c-b7ea5436a0ed","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/bd2e1f9a-3d28-42c1-991c-b7ea5436a0ed","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Bansal, N, Dadush, D & Garg, S 2019, 'An algorithm for koml\u00f3s conjecture matching Banaszczyk's bound', SIAM Journal on Computing, vol. 48, no. 2, pp. 534-553. https://doi.org/10.1137/17M1126795","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1499980992","display_name":null,"funder_award_id":"639.071.510","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G1664046972","display_name":null,"funder_award_id":"639.022.211","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6130719263","display_name":null,"funder_award_id":"617951","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6823996144","display_name":null,"funder_award_id":"022.005.0","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7157536220","display_name":null,"funder_award_id":"022.005.025","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320307521","display_name":"American Institute of Mathematics","ror":"https://ror.org/02a0fwv66"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2080064821","https://openalex.org/W2083459869","https://openalex.org/W2088402854","https://openalex.org/W2097240805","https://openalex.org/W2140322654","https://openalex.org/W2962961819"],"related_works":["https://openalex.org/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2784911598","https://openalex.org/W4297950433","https://openalex.org/W4287023968","https://openalex.org/W4288279572","https://openalex.org/W1973978937","https://openalex.org/W1983915440","https://openalex.org/W3095925971"],"abstract_inverted_index":{"We":[0,23],"consider":[1],"the":[2,38,44,64],"problem":[3,45],"of":[4],"finding":[5],"a":[6,30],"low":[7],"discrepancy":[8,33],"coloring":[9,31],"for":[10,43],"sparse":[11],"set":[12],"systems":[13],"where":[14],"each":[15],"element":[16],"lies":[17],"in":[18],"at":[19],"most":[20],"$t$":[21],"sets.":[22],"give":[24],"an":[25,54,71],"efficient":[26],"algorithm":[27],"that":[28],"finds":[29],"with":[32],"$O((t":[34],"\\log":[35,56],"n)^{1/2})$,":[36],"matching":[37],"best":[39],"known":[40],"nonconstructive":[41],"bound":[42],"due":[46],"to":[47,63],"Banaszczyk.":[48],"The":[49,59],"previous":[50],"algorithms":[51],"only":[52],"achieved":[53],"$O(t^{1/2}":[55],"n)$":[57,74],"bound.":[58,75],"result":[60],"also":[61],"extends":[62],"more":[65],"general":[66],"Koml\u00f3s":[67],"setting":[68],"and":[69],"gives":[70],"algorithmic":[72],"$O(\\log^{1/2}":[73]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2025-10-10T00:00:00"}