{"id":"https://openalex.org/W1967720682","doi":null,"title":"Nondecreasing paths in a weighted graph or: how to optimally read a train schedule","display_name":"Nondecreasing paths in a weighted graph or: how to optimally read a train schedule","alternate_titles":[],"publication_year":2008,"publication_date":"2008-01-20","ids":{"openalex":"https://openalex.org/W1967720682","mag":"1967720682"},"language":"en","primary_location":{"id":"mag:1967720682","doi":null,"is_oa":false,"landing_page_url":"https://www.cs.stanford.edu/~virgi/nondecpaths.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1967720682"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5044244682","display_name":"Virginia Vassilevska Williams","orcid":"https://orcid.org/0000-0003-4844-2863","observed_orcids":["https://orcid.org/0000-0003-4844-2863"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Virginia Vassilevska","raw_affiliation_strings":["Carnegie-Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044244682"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.7034,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.60545588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"465","last_page":"472"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/weighted-directed-graphs","display_name":"weighted directed graphs","score":0.7789999842643738},{"id":"https://openalex.org/keywords/train-scheduling","display_name":"train scheduling","score":0.6470000147819519},{"id":"https://openalex.org/keywords/travel-route-optimization","display_name":"travel route optimization","score":0.6129999756813049},{"id":"https://openalex.org/keywords/single-source-shortest-path","display_name":"single-source shortest path","score":0.5149999856948853},{"id":"https://openalex.org/keywords/all-pairs-shortest-paths","display_name":"all-pairs shortest paths","score":0.8140000104904175},{"id":"https://openalex.org/keywords/linear-time-algorithms","display_name":"linear-time algorithms","score":0.8479999899864197},{"id":"https://openalex.org/keywords/strongly-polynomial-algorithms","display_name":"strongly polynomial algorithms","score":0.7739999890327454}],"concepts":[{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5896840691566467},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5657013058662415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5330197811126709},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.531541109085083},{"id":"https://openalex.org/C190839683","wikidata":"https://www.wikidata.org/wiki/Q2448197","display_name":"Train","level":2,"score":0.5238045454025269},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49673157930374146},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4539496898651123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40079495310783386},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3133750557899475},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12251624464988708},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"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/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:1967720682","doi":null,"is_oa":false,"landing_page_url":"https://www.cs.stanford.edu/~virgi/nondecpaths.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.72.8017","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.8017","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~virgi/nondecpaths.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W273656381","https://openalex.org/W1823654214","https://openalex.org/W1941062520","https://openalex.org/W1964915778","https://openalex.org/W1970052762","https://openalex.org/W1979740015","https://openalex.org/W1986208679","https://openalex.org/W1999545213","https://openalex.org/W2008034501","https://openalex.org/W2049153008","https://openalex.org/W2049500052","https://openalex.org/W2051531384","https://openalex.org/W2057393374","https://openalex.org/W2058426370","https://openalex.org/W2084224084","https://openalex.org/W2133768189","https://openalex.org/W2152290683","https://openalex.org/W2152545366","https://openalex.org/W2154848433","https://openalex.org/W2164485560","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W3138807513"],"related_works":["https://openalex.org/W7097852178","https://openalex.org/W1978868826","https://openalex.org/W3039326214","https://openalex.org/W2268320119","https://openalex.org/W2184732484","https://openalex.org/W4392480142","https://openalex.org/W2886888786","https://openalex.org/W1568092560","https://openalex.org/W1579606576","https://openalex.org/W2941901364"],"abstract_inverted_index":{"A":[0,20],"travel":[1],"booking":[2,45],"office":[3,46],"has":[4],"timetables":[5],"giving":[6],"arrival":[7],"and":[8,18,26,100,161],"departure":[9],"times":[10],"for":[11,52,114,148,158,169],"all":[12,155],"scheduled":[13],"trains,":[14],"including":[15],"their":[16],"origins":[17],"destinations.":[19],"customer":[21],"presents":[22],"a":[23,28,73,80,83,87,163],"starting":[24],"city":[25],"demands":[27],"route":[29,51],"with":[30],"perhaps":[31],"several":[32],"train":[33],"connections":[34],"taking":[35],"him":[36],"to":[37,72,86,134],"his":[38],"destination":[39],"as":[40,42],"early":[41],"possible.":[43],"The":[44],"must":[47],"find":[48,79],"the":[49,61,92,96,101,105,111,115,120,132,143,159],"best":[50],"its":[53],"customers.":[54],"This":[55],"problem":[56,74,160],"was":[57],"first":[58,112,144],"considered":[59],"in":[60,122],"theory":[62],"of":[63,119],"algorithms":[64],"by":[65],"George":[66],"Minty":[67,109],"[Min58],":[68],"who":[69],"reduced":[70],"it":[71],"on":[75,95,104],"directed":[76],"weighted":[77],"graphs:":[78],"path":[81,97,106],"from":[82,131],"given":[84,88],"source":[85,117,133],"target":[89],"such":[90],"that":[91],"consecutive":[93],"weights":[94],"are":[98],"nondecreasing":[99,129],"last":[102,127],"weight":[103,128],"is":[107],"minimized.":[108],"gave":[110],"algorithm":[113,147,168],"single":[116],"version":[118,157],"problem,":[121],"which":[123],"one":[124],"finds":[125],"minimum":[126],"paths":[130],"every":[135],"other":[136],"vertex.":[137],"In":[138],"this":[139,149],"paper":[140],"we":[141],"give":[142,162],"linear":[145],"time":[146],"problem.":[150],"We":[151],"also":[152],"define":[153],"an":[154],"pairs":[156],"strongly":[164],"polynomial":[165],"truly":[166],"subcubic":[167],"it.":[170],"1":[171]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1967720682","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
