{"id":"https://openalex.org/W2114689831","doi":"https://doi.org/10.1142/s0129054195000111","title":"OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS","display_name":"OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W2114689831","doi":"https://doi.org/10.1142/s0129054195000111","mag":"2114689831"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054195000111","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054195000111","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5001082357","display_name":"Andrea Clementi","orcid":"https://orcid.org/0000-0002-9521-2457"},"institutions":[{"id":"https://openalex.org/I4210101866","display_name":"Informa (Italy)","ror":"https://ror.org/017c2y429","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210101866","https://openalex.org/I4210154378"]},{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"ANDREA CLEMENTI","raw_affiliation_strings":["Dipartimento di Scienze dell\u2019Informazione,  Universit\u00e0 di Roma \u201cLa Sapienza\u201d, via Salaria, 113\u201300198 Roma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze dell\u2019Informazione,  Universit\u00e0 di Roma \u201cLa Sapienza\u201d, via Salaria, 113\u201300198 Roma, Italy","institution_ids":["https://openalex.org/I861853513","https://openalex.org/I4210101866"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014515479","display_name":"Miriam Di Ianni","orcid":"https://orcid.org/0000-0002-1699-5802"},"institutions":[{"id":"https://openalex.org/I4210101866","display_name":"Informa (Italy)","ror":"https://ror.org/017c2y429","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210101866","https://openalex.org/I4210154378"]},{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"MIRIAM DI IANNI","raw_affiliation_strings":["Dipartimento di Scienze dell\u2019Informazione,  Universit\u00e0 di Roma \u201cLa Sapienza\u201d, via Salaria, 113\u201300198 Roma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze dell\u2019Informazione,  Universit\u00e0 di Roma \u201cLa Sapienza\u201d, via Salaria, 113\u201300198 Roma, Italy","institution_ids":["https://openalex.org/I861853513","https://openalex.org/I4210101866"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001082357"],"corresponding_institution_ids":["https://openalex.org/I4210101866","https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20455926,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"06","issue":"02","first_page":"155","last_page":"168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9940000176429749,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9940000176429749,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9929999709129333,"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/T12288","display_name":"Optimization and Search Problems","score":0.9923999905586243,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6419153213500977},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5902407169342041},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5833333730697632},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5450657606124878},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5264878273010254},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4952148497104645},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48018017411231995},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4567365348339081},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45495691895484924},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4284975230693817},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34970319271087646},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.34010177850723267},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3282318115234375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2891295552253723},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07743892073631287}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6419153213500977},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5902407169342041},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5833333730697632},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5450657606124878},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5264878273010254},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4952148497104645},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48018017411231995},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4567365348339081},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45495691895484924},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4284975230693817},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34970319271087646},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.34010177850723267},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3282318115234375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2891295552253723},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07743892073631287},{"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},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054195000111","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054195000111","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2086397253","https://openalex.org/W2133122801","https://openalex.org/W600422426","https://openalex.org/W1966261337","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0,24,72],"investigate":[1],"the":[2,26,30,62,67,78,81,91,97,102,120,125,149,162],"problem":[3,27,103,126,163],"of":[4,32,50,70,80,83,99,122,151],"devising":[5],"an":[6,142],"optimal":[7],"time":[8],"strategy":[9],"to":[10,16,116,139],"send":[11],"messages":[12,33],"from":[13],"one":[14],"site":[15],"another":[17],"in":[18,29,160,167],"a":[19,156],"Store":[20],"and":[21,38,65],"Forward":[22],"network.":[23],"consider":[25],"both":[28,49],"cases":[31],"transmitted":[34],"through":[35,39],"fixed":[36,100],"paths":[37],"dynamically":[40],"variable":[41],"paths,":[42,101,124],"respectively.":[43],"In":[44,87,96,119],"particular,":[45,88],"we":[46,89,154],"prove":[47,90],"that":[48],"versions":[51],"are":[52,59],"NP-complete":[53],"even":[54],"when":[55,141],"very":[56],"restrictive":[57],"hypotheses":[58],"imposed":[60],"on":[61,66,148],"network":[63,158],"topology":[64,159],"required":[68],"amount":[69],"time.":[71,170],"thus":[73],"turn":[74],"our":[75],"attention":[76],"towards":[77],"study":[79],"approximability":[82],"this":[84],"scheduling":[85],"problem.":[86],"following":[92],"negative":[93],"results:":[94],"(i)":[95],"case":[98,121],"is":[104,114,127,137,146],"not":[105,128],"approximable":[106,129],"for":[107,130],"any":[108,131],"constant":[109,132],"approximation":[110,133],"ratio":[111,134],"unless":[112],"P":[113,136],"equal":[115,138],"NP.":[117],"(ii)":[118],"arbitrary":[123,143],"(unless":[135],"NP)":[140],"priority":[144],"function":[145],"defined":[147],"set":[150],"messages.":[152],"Finally,":[153],"present":[155],"particular":[157],"which":[161],"can":[164],"be":[165],"solved":[166],"deterministic":[168],"polynomial":[169]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}