{"id":"https://openalex.org/W2061595406","doi":"https://doi.org/10.1109/lanman.2011.6076927","title":"Scheduling linear network for space and time efficiency","display_name":"Scheduling linear network for space and time efficiency","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2061595406","doi":"https://doi.org/10.1109/lanman.2011.6076927","mag":"2061595406"},"language":"en","primary_location":{"id":"doi:10.1109/lanman.2011.6076927","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lanman.2011.6076927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5087267932","display_name":"Arun K. Somani","orcid":"https://orcid.org/0000-0002-6248-4376"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arun K. Somani","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064878604","display_name":"Daniel N. Congreve","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Congreve","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.8774,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69160768,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7390127778053284},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6931093335151672},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5979956388473511},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5240861773490906},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5037946105003357},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4783886671066284},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46976539492607117},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30035102367401123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18240958452224731}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7390127778053284},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6931093335151672},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5979956388473511},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5240861773490906},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5037946105003357},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4783886671066284},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46976539492607117},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30035102367401123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18240958452224731},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lanman.2011.6076927","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lanman.2011.6076927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1501128370","https://openalex.org/W2011039300","https://openalex.org/W2032392871","https://openalex.org/W2112600558","https://openalex.org/W2118427723","https://openalex.org/W2123068254","https://openalex.org/W2128263778","https://openalex.org/W2145028977","https://openalex.org/W2155634467","https://openalex.org/W2476096155"],"related_works":["https://openalex.org/W2195904091","https://openalex.org/W2381415338","https://openalex.org/W2365404242","https://openalex.org/W2023863393","https://openalex.org/W2370319203","https://openalex.org/W4241844845","https://openalex.org/W2365866555","https://openalex.org/W2937304254","https://openalex.org/W1966261337","https://openalex.org/W2107423006"],"abstract_inverted_index":{"We":[0,122],"consider":[1],"scheduling":[2,43],"resources":[3,16,65],"on":[4,36,66],"linear":[5,34,68],"networks":[6],"where":[7],"each":[8],"request":[9],"is":[10,79,84,93,110,146],"for":[11,18,40,46,107],"a":[12,19,37,47,52,74,87,142],"set":[13],"of":[14,22,153],"contiguous":[15],"and":[17,60,118,127,139],"different":[20,117],"amount":[21],"time.":[23],"Allocating":[24],"spectrum":[25],"to":[26,86,95,120],"satisfy":[27],"variable":[28],"size":[29],"data":[30],"communication":[31,44],"requests,":[32],"utilizing":[33],"resource":[35,75],"light-trail":[38],"network":[39,50,54],"higher":[41],"efficiency,":[42],"path":[45],"segmented":[48],"light-trails":[49],"or":[51,63],"multi-hop":[53],"with":[55,99,135],"no":[56],"intermediate":[57],"storage":[58],"(receive":[59],"forward":[61],"paradigm),":[62],"allocating":[64],"any":[67],"pipeline,":[69],"would":[70],"benefit":[71],"from":[72],"such":[73],"allocation":[76],"scheme":[77],"which":[78,92],"proposed":[80],"here.":[81],"The":[82],"problem":[83,116],"similar":[85],"two-dimensional":[88],"bin":[89],"packing":[90],"problem,":[91],"known":[94],"be":[96],"NP-hard,":[97],"but":[98],"an":[100,108,124],"additional":[101],"constraint":[102],"that":[103,129,141],"one":[104],"coordinate":[105],"location":[106],"object":[109],"already":[111],"fixed.":[112],"That":[113],"makes":[114],"the":[115,150],"interesting":[119],"solve.":[121],"develop":[123],"efficient":[125],"algorithm":[126],"show":[128],"it":[130],"find":[131],"minimal":[132],"length":[133,144],"schedule":[134,145],"very":[136],"high":[137],"probability":[138],"demonstrate":[140],"minimum":[143],"not":[147],"determined":[148],"by":[149],"usage":[151],"durations":[152],"individual":[154],"resources.":[155]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}