{"id":"https://openalex.org/W2941123376","doi":"https://doi.org/10.23919/wiopt47501.2019.9144114","title":"Complexity of URLLC Scheduling and Efficient Approximation Schemes","display_name":"Complexity of URLLC Scheduling and Efficient Approximation Schemes","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2941123376","doi":"https://doi.org/10.23919/wiopt47501.2019.9144114","mag":"2941123376"},"language":"en","primary_location":{"id":"doi:10.23919/wiopt47501.2019.9144114","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt47501.2019.9144114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1904.11278","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062222447","display_name":"Apostolos Destounis","orcid":"https://orcid.org/0000-0003-0420-3430"},"institutions":[{"id":"https://openalex.org/I2250955327","display_name":"Huawei Technologies (China)","ror":"https://ror.org/00cmhce21","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250955327"]},{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["CN","FR"],"is_corresponding":false,"raw_author_name":"Apostolos Destounis","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, France Research Center, Huawei Technologies Co. Ltd","Huawei#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, France Research Center, Huawei Technologies Co. Ltd","institution_ids":["https://openalex.org/I4210123571"]},{"raw_affiliation_string":"Huawei#TAB#","institution_ids":["https://openalex.org/I2250955327"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070393786","display_name":"Georgios S. Paschos","orcid":"https://orcid.org/0000-0002-5922-1612"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Georgios S. Paschos","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, France Research Center, Huawei Technologies Co. Ltd"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, France Research Center, Huawei Technologies Co. Ltd","institution_ids":["https://openalex.org/I4210123571"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9970999956130981,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7088561654090881},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6641024351119995},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6082243919372559},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6041806936264038},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5558261275291443},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5416463017463684},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.47925233840942383},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44027161598205566},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41633403301239014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33140432834625244},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20579317212104797}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7088561654090881},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6641024351119995},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6082243919372559},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6041806936264038},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5558261275291443},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5416463017463684},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.47925233840942383},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44027161598205566},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41633403301239014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33140432834625244},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20579317212104797},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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/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.23919/wiopt47501.2019.9144114","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt47501.2019.9144114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1904.11278","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.11278","pdf_url":"https://arxiv.org/pdf/1904.11278","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":"mag:2941123376","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1904.11278","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1904.11278","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1904.11278","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1904.11278","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.11278","pdf_url":"https://arxiv.org/pdf/1904.11278","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"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.41999998688697815,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2941123376.pdf","grobid_xml":"https://content.openalex.org/works/W2941123376.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1491127810","https://openalex.org/W1561372264","https://openalex.org/W1964773003","https://openalex.org/W1995100690","https://openalex.org/W2036533317","https://openalex.org/W2053913299","https://openalex.org/W2106864314","https://openalex.org/W2142210007","https://openalex.org/W2262889796","https://openalex.org/W2433339266","https://openalex.org/W2594514522","https://openalex.org/W2604174486","https://openalex.org/W2626444157","https://openalex.org/W2781593575","https://openalex.org/W2790941625","https://openalex.org/W2796283700","https://openalex.org/W2798625559","https://openalex.org/W2803466884","https://openalex.org/W2963077778","https://openalex.org/W2963135374","https://openalex.org/W2964259990","https://openalex.org/W2964326082"],"related_works":["https://openalex.org/W2943988096","https://openalex.org/W2889223869","https://openalex.org/W3116582455","https://openalex.org/W1520182428","https://openalex.org/W1536568986","https://openalex.org/W3157138836","https://openalex.org/W2154783275","https://openalex.org/W2077603713","https://openalex.org/W3112287869","https://openalex.org/W2943747303","https://openalex.org/W2277522165","https://openalex.org/W3033749387","https://openalex.org/W2945578113","https://openalex.org/W1967920323","https://openalex.org/W2795063374","https://openalex.org/W2915425035","https://openalex.org/W2784056721","https://openalex.org/W2374446459","https://openalex.org/W2959305142","https://openalex.org/W2151353987"],"abstract_inverted_index":{"In":[0,72],"this":[1],"paper":[2],"we":[3,76,165,190],"address":[4],"the":[5,26,35,108,116,119,145,162,178,199],"problem":[6],"of":[7,74,83,126,144,172,213],"joint":[8],"admission":[9],"control":[10],"and":[11,38,54,131,176],"resource":[12,31,44,65],"scheduling":[13],"for":[14,51,67,97,174,198],"Ultra":[15],"Reliable":[16],"Low":[17],"Latency":[18],"Communications":[19],"(URLLC).":[20],"We":[21,90,204],"examine":[22],"two":[23],"models:":[24],"(i)":[25],"continuous,":[27],"where":[28,42,147],"all":[29],"allocated":[30],"blocks":[32,45,66],"contribute":[33],"to":[34,133,192],"success":[36],"probability,":[37],"(ii)":[39],"a":[40,68,81,94,123,169,210],"binary,":[41],"only":[43],"with":[46,209],"strong":[47],"signal":[48],"are":[49,77],"\u201cactive\u201d":[50],"each":[52],"user,":[53],"user":[55],"<tex":[56,100,148],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[57,62,101,137,141,149,154,158],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$k$</tex>":[58],"needs":[59],"d":[60,156],"<inf":[61,136,153,157],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k</inf>":[63,155,159],"active":[64],"successful":[69],"URLLC":[70,103,127],"transmission.":[71],"situations":[73],"congestion,":[75],"interested":[78],"in":[79,107,115,186],"finding":[80,93,177],"subset":[82],"users":[84,104,128,173],"that":[85,92,167],"can":[86,183],"be":[87,184],"scheduled":[88],"simultaneously.":[89],"show":[91],"feasible":[95,124],"schedule":[96,180],"at":[98],"least":[99],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m$</tex>":[102],"is":[105,129],"NP-complete":[106],"(easier)":[109],"binary":[110],"SNR":[111,202],"model,":[112],"hence":[113],"also":[114],"continuous.":[117],"Maximizing":[118],"reward":[120],"obtained":[121],"from":[122],"set":[125,171],"NP-hard":[130],"inapproximable":[132],"within":[134],"(log":[135],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>":[138],"d)":[139],"<sup":[140],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[142],"/d":[143],"optimal,":[146],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d$</tex>":[150],"\u2250":[151],"max":[152],".":[160],"On":[161],"other":[163],"hand,":[164],"prove":[166],"checking":[168],"candidate":[170],"feasibility":[175],"corresponding":[179],"(when":[181],"feasible)":[182],"done":[185],"polynomial":[187],"time,":[188],"which":[189],"exploit":[191],"design":[193],"an":[194],"efficient":[195],"heuristic":[196],"algorithm":[197],"general":[200],"continuous":[201],"model.":[203],"complement":[205],"our":[206,214],"theoretical":[207],"contributions":[208],"numerical":[211],"evaluation":[212],"proposed":[215],"schemes.":[216]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}