{"id":"https://openalex.org/W4281616636","doi":"https://doi.org/10.1201/9781003033707-3","title":"Multi-Objective Shortest Paths","display_name":"Multi-Objective Shortest Paths","publication_year":2022,"publication_date":"2022-05-26","ids":{"openalex":"https://openalex.org/W4281616636","doi":"https://doi.org/10.1201/9781003033707-3"},"language":"en","primary_location":{"id":"doi:10.1201/9781003033707-3","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781003033707-3","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Massive Graph Analytics","raw_type":"book-chapter"},"type":"book-chapter","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/A5075814643","display_name":"Stephan Erb","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Stephan Erb","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088522629","display_name":"Moritz Kobitzsch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moritz Kobitzsch","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110577817","display_name":"Lawrence Mandow","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lawrence Mandow","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5082922326","display_name":"Peter Sanders","orcid":"https://orcid.org/0000-0003-3330-9349"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter Sanders","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075814643"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11205074,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"35","last_page":"59"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.8790000081062317,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.8790000081062317,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.8483999967575073,"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/computer-science","display_name":"Computer science","score":0.4547232687473297}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4547232687473297}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1201/9781003033707-3","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781003033707-3","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Massive Graph Analytics","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655","https://openalex.org/W2359140296"],"abstract_inverted_index":{"In":[0],"this":[1,91],"chapter,":[2],"the":[3,9,25,30,34,71,87,97],"authors":[4],"present":[5],"some":[6,119,153],"developments":[7],"in":[8,43,90,107,118,152],"parallelization":[10],"of":[11,37,54],"multi-objective":[12,62],"shortest":[13,41],"path":[14],"search.":[15],"It":[16],"is":[17,45,77,93,117,140,151],"based":[18],"on":[19,68],"two":[20],"conference":[21],"papers":[22],"\u2013":[23],"for":[24,29,61],"theoretical":[26],"part":[27],"and":[28,33,99,131],"practical":[31,138],"part,":[32],"Master":[35],"thesis":[36],"Stephan":[38],"Erb.":[39],"Finding":[40],"paths":[42],"graphs":[44],"a":[46,51,65,74,108],"classical":[47,57],"optimization":[48],"problem":[49],"with":[50,70],"large":[52],"number":[53],"applications.":[55],"The":[56,83,111,145],"sequential":[58],"label-setting":[59],"algorithms":[60],"search":[63,98],"define":[64],"total":[66],"order":[67],"labels":[69],"property":[72],"that":[73,96,136],"minimal":[75],"label":[76],"Pareto":[78],"optimal":[79],"among":[80],"all":[81],"labels.":[82],"basic":[84],"idea":[85],"behind":[86],"improvements":[88],"described":[89,114,148],"chapter":[92],"to":[94,123,143,157],"exploit":[95],"update":[100],"operations":[101],"performed":[102],"by":[103],"paPaSearch":[104],"are":[105],"done":[106],"batched":[109],"fashion.":[110],"parallel":[112,146],"algorithm":[113,147],"so":[115,135,149],"far":[116,150],"sense":[120,154],"already":[121,155],"close":[122,156],"being":[124,158],"practical.":[125,159],"However,":[126],"it":[127],"uses":[128],"very":[129],"fine-grained":[130],"irregularly":[132],"structured":[133],"parallelism":[134],"good":[137],"performance":[139],"not":[141],"trivial":[142],"obtain.":[144]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}