{"id":"https://openalex.org/W7128785388","doi":"https://doi.org/10.48550/arxiv.2602.12126","title":"Optimizing Distances for Multi-Broadcast in Temporal Graphs","display_name":"Optimizing Distances for Multi-Broadcast in Temporal Graphs","publication_year":2026,"publication_date":"2026-02-12","ids":{"openalex":"https://openalex.org/W7128785388","doi":"https://doi.org/10.48550/arxiv.2602.12126"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.12126","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5117111270","display_name":"Daniele Carnevale","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Carnevale, Daniele","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125916481","display_name":"Gianlorenzo D'Angelo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D'Angelo, Gianlorenzo","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5117111270"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.8752999901771545,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.8752999901771545,"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/T11478","display_name":"Caching and Content Delivery","score":0.017999999225139618,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.01759999990463257,"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/complement","display_name":"Complement (music)","score":0.5778999924659729},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5570999979972839},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5371999740600586},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49390000104904175},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.4424999952316284},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.40689998865127563},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.34880000352859497},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.33230000734329224}],"concepts":[{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5778999924659729},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5570999979972839},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5371999740600586},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49390000104904175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4595000147819519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4438000023365021},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.4424999952316284},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.40689998865127563},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39739999175071716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38519999384880066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.384799987077713},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3847000002861023},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.34880000352859497},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.33230000734329224},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.3197000026702881},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2847000062465668},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2736000120639801},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25600001215934753}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.12126","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.12126","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.12126","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.12126","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Temporal":[0],"graphs":[1],"represent":[2],"networks":[3],"in":[4,20,113],"which":[5,35],"connections":[6],"change":[7],"over":[8],"time,":[9],"with":[10,173],"edges":[11,42],"available":[12],"only":[13],"at":[14],"specific":[15],"moments.":[16],"Motivated":[17],"by":[18,182],"applications":[19],"logistics,":[21],"multi-agent":[22],"information":[23],"spreading,":[24],"and":[25,77,99,118,129,149,191],"wireless":[26],"networks,":[27],"we":[28,106],"introduce":[29],"the":[30,39,56,74,122,139,161],"D-Temporal":[31],"Multi-Broadcast":[32],"(D-TMB)":[33],"problem,":[34],"asks":[36],"for":[37,116,121,147,189,193],"scheduling":[38],"availability":[40],"of":[41,48,79,84,196],"so":[43],"that":[44,66,108,136,186],"a":[45,103,134,159],"predetermined":[46],"subset":[47],"sources":[49],"reach":[50],"all":[51],"other":[52,123],"vertices":[53],"while":[54,120],"optimizing":[55],"worst-case":[57],"temporal":[58,85,124],"distance":[59,86,141],"D":[60],"from":[61],"any":[62,166,194],"source.":[63],"We":[64,71,143,177],"show":[65,107],"D-TMB":[67,80,109],"generalizes":[68],"ReachFast":[69],"(arXiv:2112.08797).":[70],"then":[72],"characterize":[73],"computational":[75],"complexity":[76],"approximability":[78],"under":[81],"six":[82],"definitions":[83],"D,":[87],"namely":[88],"Earliest-Arrival":[89],"(EA),":[90],"Latest-Departure":[91],"(LD),":[92],"Fastest-Time":[93],"(FT),":[94],"Shortest-Traveling":[95],"(ST),":[96],"Minimum-Hop":[97],"(MH),":[98],"Minimum-Waiting":[100],"(MW).":[101],"For":[102,151],"single":[104],"source,":[105],"can":[110],"be":[111],"solved":[112],"polynomial":[114],"time":[115],"EA":[117,190],"LD,":[119],"distances":[125],"it":[126],"is":[127,156,163],"NP-hard":[128],"hard":[130],"to":[131],"approximate":[132],"within":[133,165],"factor":[135,167],"depends":[137],"on":[138],"adopted":[140],"function.":[142],"give":[144],"approximation":[145],"algorithms":[146],"FT":[148],"MW.":[150],"multiple":[152],"sources,":[153],"if":[154],"feasibility":[155],"not":[157],"assumed":[158],"priori,":[160],"problem":[162],"inapproximable":[164],"unless":[168],"P":[169],"=":[170],"NP,":[171],"even":[172],"just":[174],"two":[175],"sources.":[176,197],"complement":[178],"this":[179],"negative":[180],"result":[181],"identifying":[183],"structural":[184],"conditions":[185],"guarantee":[187],"tractability":[188],"LD":[192],"number":[195]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-14T00:00:00"}