{"id":"https://openalex.org/W7159615208","doi":"https://doi.org/10.48550/arxiv.2604.27757","title":"Temporal Routing in Static Networks: The Schedule Completion Problem","display_name":"Temporal Routing in Static Networks: The Schedule Completion Problem","publication_year":2026,"publication_date":"2026-04-30","ids":{"openalex":"https://openalex.org/W7159615208","doi":"https://doi.org/10.48550/arxiv.2604.27757"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.27757","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.27757","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.27757","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006143744","display_name":"Michelle D\u00f6ring","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D\u00f6ring, Michelle","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119759058","display_name":"Niklas Mohrin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohrin, Niklas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5006076693","display_name":"George Skretas","orcid":"https://orcid.org/0000-0003-2514-8004"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Skretas, George","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"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.4397999942302704,"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.4397999942302704,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.12710000574588776,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.09920000284910202,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6319000124931335},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6315000057220459},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5831000208854675},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5026000142097473},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4885999858379364},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4871000051498413},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.45989999175071716},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4499000012874603}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6319000124931335},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6315000057220459},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5845000147819519},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5831000208854675},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5026000142097473},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4885999858379364},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4871000051498413},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45989999175071716},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4499000012874603},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4424000084400177},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40400001406669617},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37790000438690186},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3698999881744385},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3546999990940094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3537999987602234},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3352999985218048},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.31690001487731934},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31290000677108765},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.26510000228881836},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.25589999556541443}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.27757","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.27757","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":"doi:10.48550/arxiv.2604.27757","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.27757","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,54,89],"introduce":[1],"the":[2,37,47,112,115,137,154],"TemporallyEdgeDisjointScheduleCompletion":[3],"(TEDSC)":[4],"problem":[5,35],"in":[6,75],"which":[7,76],"we":[8,67,110,149],"need":[9],"to":[10,152,160],"cover":[11],"a":[12,25,56,131,161],"set":[13],"of":[14,40,50,73,133,156,163],"temporal":[15,22,38],"edge":[16,32],"demands":[17,45],"$D$":[18],"by":[19,63,97,127],"routing":[20,42],"$k$":[21,128],"walks":[23,158],"through":[24],"directed":[26],"static":[27,48],"graph":[28],"while":[29],"remaining":[30],"temporally":[31],"disjoint.":[33],"This":[34],"combines":[36],"aspects":[39],"train":[41],"and":[43,105],"passenger":[44],"with":[46],"nature":[49],"real-world":[51],"rail":[52],"networks.":[53],"present":[55],"polynomial":[57],"time":[58,87,138],"algorithm":[59,143],"for":[60,82,103],"TEDSC.":[61],"Motivated":[62],"real":[64],"world":[65],"constraints,":[66],"next":[68],"investigate":[69],"two":[70,116],"restricted":[71],"variants":[72],"TEDSC":[74],"each":[77],"walk":[78],"can":[79],"only":[80],"travel":[81],"some":[83],"bounded":[84],"distance":[85,122],"or":[86],"$h$.":[88],"show":[90,150],"that":[91],"both":[92],"are":[93],"tractable":[94],"when":[95],"parameterized":[96,126],"$k":[98,106],"+":[99,107],"h$,":[100],"but":[101],"hard":[102],"$h$":[104],"|D|$.":[108],"If":[109],"fix":[111],"underlying":[113],"network,":[114],"problems":[117],"exhibit":[118],"distinct":[119],"complexities:":[120],"The":[121],"variant":[123,139],"remains":[124],"$W[1]$-hard":[125],"even":[129],"on":[130,144],"path":[132],"three":[134],"vertices":[135],"whereas":[136],"admits":[140],"an":[141],"FPT":[142],"any":[145],"fixed":[146],"star.":[147],"Finally,":[148],"how":[151],"approximate":[153],"number":[155],"required":[157],"up":[159],"factor":[162],"$(2-h^{-1})$.":[164]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-02T00:00:00"}