{"id":"https://openalex.org/W7163696646","doi":"https://doi.org/10.48550/arxiv.2606.05956","title":"Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics","display_name":"Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics","publication_year":2026,"publication_date":"2026-06-04","ids":{"openalex":"https://openalex.org/W7163696646","doi":"https://doi.org/10.48550/arxiv.2606.05956"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.05956","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.05956","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.05956","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119019994","display_name":"Tzur Shubi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shubi, Tzur","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011195666","display_name":"Ariel Felner","orcid":"https://orcid.org/0000-0003-0065-2757"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Felner, Ariel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019694415","display_name":"Solomon Eyal Shimony","orcid":"https://orcid.org/0000-0001-6204-9166"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shimony, Solomon Eyal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073638946","display_name":"Shahaf Shperberg","orcid":"https://orcid.org/0000-0001-7683-3031"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shperberg, Shahaf S.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.24639999866485596,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.24639999866485596,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.11990000307559967,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.11379999667406082,"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/heuristics","display_name":"Heuristics","score":0.8047000169754028},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6747999787330627},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6420999765396118},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6126000285148621},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5673999786376953},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5370000004768372},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5092999935150146}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8047000169754028},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6747999787330627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.666100025177002},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6420999765396118},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6126000285148621},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5673999786376953},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5370000004768372},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5092999935150146},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.46869999170303345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46160000562667847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4336000084877014},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.3230000138282776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2987000048160553},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.29319998621940613},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26589998602867126},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.05956","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.05956","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.05956","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.05956","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"Bidirectional":[0,52],"heuristic":[1,81],"search":[2,6],"can":[3,21,100],"potentially":[4],"reduce":[5,22],"effort":[7],"for":[8,59],"problems":[9,62,107],"amenable":[10],"to":[11,64,104,116],"backward":[12],"search.":[13],"Therein,":[14],"it":[15],"is":[16,31,114],"well-known":[17],"that":[18,34,48,97,133],"front-to-front":[19,79],"heuristics":[20],"the":[23,50,65,87,134,139],"number":[24,140],"of":[25,119,141],"node":[26,142],"expansions,":[27],"but":[28],"their":[29],"overhead":[30,88],"so":[32],"high":[33],"overall":[35,150],"runtime":[36],"almost":[37],"always":[38],"increases.":[39],"We":[40,95],"propose":[41],"BiXDFBnB,":[42],"a":[43],"bidirectional":[44,92],"depth-first":[45],"branch-and-bound":[46],"algorithm":[47,136],"adapts":[49],"Single-Frontier":[51],"Search":[53],"(SFBDS)":[54],"framework":[55],"-":[56,63],"originally":[57],"developed":[58],"shortest-path":[60],"(MIN)":[61],"Generalized":[66],"Longest":[67,122],"Simple":[68,123],"Path":[69,124],"(GLSP)":[70],"setting.":[71],"Because":[72],"SFBDS":[73],"inherently":[74],"operates":[75],"on":[76],"paired":[77],"states,":[78],"(F2F)":[80],"evaluation":[82,131],"arises":[83],"naturally":[84],"and":[85,127],"avoids":[86],"typically":[89],"associated":[90],"with":[91],"frontier":[93],"management.":[94],"show":[96],"this":[98],"adaptation":[99],"be":[101],"successfully":[102],"applied":[103,115],"maximization":[105],"(MAX)":[106],"while":[108],"efficiently":[109],"handling":[110],"overlapping":[111],"constraints.":[112],"BiXDFBnB":[113],"several":[117],"types":[118],"longest-path":[120],"problems:":[121],"(LSP),":[125],"Snakes,":[126],"Coil-in-the-Box":[128],"(CIB).":[129],"Empirical":[130],"shows":[132],"new":[135],"frequently":[137],"reduces":[138],"expansions":[143],"and,":[144],"in":[145],"some":[146],"cases,":[147],"also":[148],"improves":[149],"runtime.":[151]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-06T00:00:00"}