{"id":"https://openalex.org/W2767379942","doi":"https://doi.org/10.1109/tnet.2017.2761191","title":"On the Possibility of Network Scheduling With Polynomial Complexity and Delay","display_name":"On the Possibility of Network Scheduling With Polynomial Complexity and Delay","publication_year":2017,"publication_date":"2017-11-09","ids":{"openalex":"https://openalex.org/W2767379942","doi":"https://doi.org/10.1109/tnet.2017.2761191","mag":"2767379942"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2017.2761191","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2017.2761191","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","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/A5076011813","display_name":"Arsalan Sharifnassab","orcid":"https://orcid.org/0000-0002-3910-2878"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Arsalan Sharifnassab","raw_affiliation_strings":["Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran"],"raw_orcid":"https://orcid.org/0000-0002-3910-2878","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004045939","display_name":"S. Jamaloddin Golestani","orcid":"https://orcid.org/0000-0001-9797-0748"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"S. Jamaloddin Golestani","raw_affiliation_strings":["Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18551564,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"6","first_page":"3850","last_page":"3862"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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.9983999729156494,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9983000159263611,"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/scheduling","display_name":"Scheduling (production processes)","score":0.6824241280555725},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6623647212982178},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6506900787353516},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5378535985946655},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5319535732269287},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.43180179595947266},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4277162551879883},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42542850971221924},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4237889051437378},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41083431243896484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3709995150566101},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32804596424102783},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30135905742645264},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13236266374588013}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6824241280555725},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6623647212982178},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6506900787353516},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5378535985946655},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5319535732269287},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.43180179595947266},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4277162551879883},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42542850971221924},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4237889051437378},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41083431243896484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3709995150566101},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32804596424102783},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30135905742645264},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13236266374588013},{"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/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2017.2761191","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2017.2761191","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.49000000953674316}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322243","display_name":"Iran National Science Foundation","ror":"https://ror.org/03sr1ma14"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W181733065","https://openalex.org/W987035227","https://openalex.org/W1527197079","https://openalex.org/W1570584007","https://openalex.org/W1583497301","https://openalex.org/W1607044975","https://openalex.org/W1963511606","https://openalex.org/W1969520463","https://openalex.org/W1998800093","https://openalex.org/W2001663593","https://openalex.org/W2011039300","https://openalex.org/W2013522700","https://openalex.org/W2015263936","https://openalex.org/W2048153686","https://openalex.org/W2059453880","https://openalex.org/W2059608229","https://openalex.org/W2063572899","https://openalex.org/W2076426337","https://openalex.org/W2096752169","https://openalex.org/W2097058227","https://openalex.org/W2103468752","https://openalex.org/W2105177639","https://openalex.org/W2106285343","https://openalex.org/W2112577169","https://openalex.org/W2123893388","https://openalex.org/W2129219909","https://openalex.org/W2133894990","https://openalex.org/W2137411431","https://openalex.org/W2138993731","https://openalex.org/W2146766934","https://openalex.org/W2149632365","https://openalex.org/W2152652256","https://openalex.org/W2152859483","https://openalex.org/W2155730370","https://openalex.org/W2156006461","https://openalex.org/W2506108511","https://openalex.org/W2611804663","https://openalex.org/W3101637649","https://openalex.org/W3166880264","https://openalex.org/W4211092921","https://openalex.org/W4214625098","https://openalex.org/W4231436342","https://openalex.org/W4233756358","https://openalex.org/W4249318479","https://openalex.org/W4298227433","https://openalex.org/W4300950189"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W1589381382","https://openalex.org/W4299801389","https://openalex.org/W961142965","https://openalex.org/W2574604093","https://openalex.org/W2775068415"],"abstract_inverted_index":{"Considering":[0],"the":[1,28,59,98],"collection":[2,72],"of":[3,51,61,73,100,106],"all":[4,92],"networks":[5,52,74],"with":[6,21,75],"independent":[7,30,82],"set":[8,31,83],"interference":[9,77,84],"model,":[10],"Shah,":[11],"Tse,":[12],"and":[13,24,53,64,88,103],"Tsitsiklis":[14],"showed":[15],"that":[16],"there":[17],"exist":[18],"scheduling":[19,66,102],"algorithms":[20,67],"polynomial":[22,37,62,101],"complexity":[23,63],"delay,":[25],"only":[26],"if":[27],"maximum":[29,107],"problem":[32],"can":[33],"be":[34],"solved":[35],"in":[36],"time":[38],"(equivalently,":[39],"P=NP).":[40],"In":[41],"this":[42,46],"paper,":[43],"we":[44],"extend":[45],"result":[47],"to":[48,69,81,97],"arbitrary":[49,76],"collections":[50],"present":[54],"a":[55,70],"clear-cut":[56],"criterion":[57],"for":[58],"existence":[60],"delay":[65],"relative":[68],"given":[71],"models,":[78,87],"not":[79,89],"confined":[80],"or":[85],"SINR":[86],"necessarily":[90],"encompassing":[91],"network":[93],"topologies.":[94],"This":[95],"amounts":[96],"equivalence":[99],"effective":[104],"approximation":[105],"weighted":[108],"actions.":[109]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}