{"id":"https://openalex.org/W3183593772","doi":"https://doi.org/10.1016/j.tcs.2022.10.042","title":"A simple optimal contention resolution scheme for uniform matroids","display_name":"A simple optimal contention resolution scheme for uniform matroids","publication_year":2022,"publication_date":"2022-11-07","ids":{"openalex":"https://openalex.org/W3183593772","doi":"https://doi.org/10.1016/j.tcs.2022.10.042","mag":"3183593772"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2022.10.042","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2022.10.042","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2022.10.042","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032576640","display_name":"Danish Kashaev","orcid":"https://orcid.org/0000-0002-7999-4989"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Danish Kashaev","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068922015","display_name":"Richard Santiago","orcid":"https://orcid.org/0000-0002-3515-4953"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Richard Santiago","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032576640"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.01639404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"940","issue":null,"first_page":"81","last_page":"96"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9937999844551086,"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/matroid","display_name":"Matroid","score":0.8268705606460571},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7654497623443604},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6750982999801636},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5618870258331299},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.51547771692276},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5065966844558716},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.49209970235824585},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4495096802711487},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4451538026332855},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.44324737787246704},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.43770354986190796},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.434432715177536},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2521514892578125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1102999746799469},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09409552812576294}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8268705606460571},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7654497623443604},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6750982999801636},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5618870258331299},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.51547771692276},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5065966844558716},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.49209970235824585},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4495096802711487},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4451538026332855},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.44324737787246704},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.43770354986190796},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.434432715177536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2521514892578125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1102999746799469},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09409552812576294},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/j.tcs.2022.10.042","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2022.10.042","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2105.11992","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.11992","pdf_url":"https://arxiv.org/pdf/2105.11992","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":null,"raw_type":"text"},{"id":"pmh:oai:cwi.nl:31381","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/31381","pdf_url":"https://ir.cwi.nl/pub/31381/31381.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":null,"raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/584179","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/584179","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 940 (Part A)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.3929/ethz-b-000584179","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000584179","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2022.10.042","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2022.10.042","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W39861960","https://openalex.org/W100324934","https://openalex.org/W1498671329","https://openalex.org/W1882088118","https://openalex.org/W2094067695","https://openalex.org/W2122109562","https://openalex.org/W2126307323","https://openalex.org/W2179880041","https://openalex.org/W2482182218","https://openalex.org/W2774720496","https://openalex.org/W2912310074","https://openalex.org/W2963368420","https://openalex.org/W2963536720","https://openalex.org/W2964219320","https://openalex.org/W3091384923","https://openalex.org/W3184864859","https://openalex.org/W4213255380","https://openalex.org/W4253579101","https://openalex.org/W6639171928","https://openalex.org/W6646023306","https://openalex.org/W6678838499","https://openalex.org/W6745513365","https://openalex.org/W6749682027","https://openalex.org/W6752742189","https://openalex.org/W6762022753","https://openalex.org/W6762507712"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4323360720","https://openalex.org/W1550144461","https://openalex.org/W4233892543","https://openalex.org/W2783959783","https://openalex.org/W2602164040","https://openalex.org/W2037206237","https://openalex.org/W4310658774","https://openalex.org/W3000635646","https://openalex.org/W2387188054"],"abstract_inverted_index":{"Contention":[0],"resolution":[1],"schemes":[2],"(or":[3],"CR":[4,37,72,96,129,211],"schemes),":[5],"introduced":[6],"by":[7,168],"Chekuri,":[8],"Vondrak":[9],"and":[10,59,98,126,145,186,202],"Zenklusen,":[11],"are":[12],"a":[13,21,25,28,40,45,55,71,94,124,141],"class":[14],"of":[15,113,116,134,143,199],"randomized":[16],"rounding":[17],"algorithms":[18],"for":[19,27,109,131,213],"converting":[20],"fractional":[22,41],"solution":[23],"to":[24,53,66,159],"relaxation":[26,46],"down-closed":[29],"constraint":[30],"family":[31],"into":[32,208],"an":[33,176,209],"integer":[34],"solution.":[35],"A":[36],"scheme":[38,73,130,205,212],"takes":[39],"point":[42],"x":[43],"in":[44,64,106],"polytope,":[47],"rounds":[48],"each":[49],"coordinate":[50],"xi":[51],"independently":[52],"get":[54],"possibly":[56],"non-feasible":[57],"set,":[58],"then":[60],"drops":[61],"some":[62],"elements":[63,139],"order":[65],"satisfy":[67],"the":[68,110,187,193,197],"constraints.":[69],"Intuitively,":[70],"is":[74,80,88,101,105,149],"c-balanced":[75],"if":[76],"every":[77],"element":[78],"i":[79],"selected":[81],"with":[82,140],"probability":[83],"at":[84],"least":[85],"c\u22c5xi.":[86],"It":[87],"known":[89,171],"that":[90,99,147],"general":[91],"matroids":[92,115,133],"admit":[93],"(1\u22121/e)-balanced":[95],"scheme,":[97],"this":[100,120,148,154,162],"(asymptotically)":[102],"optimal.":[103,150],"This":[104,204],"particular":[107],"true":[108],"special":[111],"case":[112],"uniform":[114,132],"rank":[117,135],"one.":[118],"In":[119],"work,":[121],"we":[122],"provide":[123],"simple":[125,201],"explicit":[127],"monotone":[128],"k":[136],"on":[137,192],"n":[138,152],"balancedness":[142],"1\u2212(nk)(1\u2212kn)n+1\u2212k(kn)k,":[144],"show":[146],"As":[151],"grows,":[153],"expression":[155],"converges":[156],"from":[157],"above":[158],"1\u2212e\u2212kkk/k!.":[160],"While":[161],"asymptotic":[163],"bound":[164],"can":[165],"be":[166],"obtained":[167],"combining":[169],"previously":[170],"results,":[172],"these":[173],"require":[174],"defining":[175],"exponential-sized":[177],"linear":[178],"program,":[179],"as":[180,182],"well":[181],"using":[183],"random":[184],"sampling":[185],"ellipsoid":[188],"algorithm.":[189],"Our":[190],"procedure,":[191],"other":[194],"hand,":[195],"has":[196],"advantage":[198],"being":[200],"explicit.":[203],"extends":[206],"naturally":[207],"optimal":[210],"partition":[214],"matroids.":[215]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-12T08:28:47.272897","created_date":"2025-10-10T00:00:00"}
