{"id":"https://openalex.org/W2101867522","doi":"https://doi.org/10.1007/3-540-45678-3_63","title":"The Cent-dian Path Problem on Tree Networks","display_name":"The Cent-dian Path Problem on Tree Networks","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2101867522","doi":"https://doi.org/10.1007/3-540-45678-3_63","mag":"2101867522"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45678-3_63","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45678-3_63","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","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/A5069480667","display_name":"Ronald I. Becker","orcid":null},"institutions":[{"id":"https://openalex.org/I157614274","display_name":"University of Cape Town","ror":"https://ror.org/03p74gp79","country_code":"ZA","type":"education","lineage":["https://openalex.org/I157614274"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Ronald I. Becker","raw_affiliation_strings":["Department of Mathematics, University of Cape Town, 7700, Rondebosh, South Africa"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Cape Town, 7700, Rondebosh, South Africa","institution_ids":["https://openalex.org/I157614274"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001519908","display_name":"Yen-I Chiang","orcid":"https://orcid.org/0000-0001-7613-5428"},"institutions":[{"id":"https://openalex.org/I157614274","display_name":"University of Cape Town","ror":"https://ror.org/03p74gp79","country_code":"ZA","type":"education","lineage":["https://openalex.org/I157614274"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Yen-I Chiang","raw_affiliation_strings":["Department of Mathematics, University of Cape Town, 7700, Rondebosh, South Africa"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Cape Town, 7700, Rondebosh, South Africa","institution_ids":["https://openalex.org/I157614274"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014275138","display_name":"Isabella Lari","orcid":"https://orcid.org/0000-0002-3207-2493"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Isabella Lari","raw_affiliation_strings":["Dipartimento di Statistica, Probabilit\u00e0 e Statistiche Applicate, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, P.le A. Moro 5, 00185, Roma, Italy","Dipartimento di Statistica, Probabilit\u00e0 e Statistiche Applicate, Universit\u00e0 di Roma \"La Sapienza\", P.le A. Moro 5, 00185, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Statistica, Probabilit\u00e0 e Statistiche Applicate, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, P.le A. Moro 5, 00185, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartimento di Statistica, Probabilit\u00e0 e Statistiche Applicate, Universit\u00e0 di Roma \"La Sapienza\", P.le A. Moro 5, 00185, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013493866","display_name":"Andrea Scozzari","orcid":"https://orcid.org/0000-0003-3038-3957"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Andrea Scozzari","raw_affiliation_strings":["Dipartimento di Statistica, Probabilit\u00e0 e Statistiche Applicate, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, P.le A. Moro 5, 00185, Roma, Italy","Dipartimento di Statistica, Probabilit\u00e0 e Statistiche Applicate, Universit\u00e0 di Roma \"La Sapienza\", P.le A. Moro 5, 00185, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Statistica, Probabilit\u00e0 e Statistiche Applicate, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, P.le A. Moro 5, 00185, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartimento di Statistica, Probabilit\u00e0 e Statistiche Applicate, Universit\u00e0 di Roma \"La Sapienza\", P.le A. Moro 5, 00185, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5069480667"],"corresponding_institution_ids":["https://openalex.org/I157614274"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.18570255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"743","last_page":"755"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9704999923706055,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9524000287055969,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/longest-path-problem","display_name":"Longest path problem","score":0.6858565807342529},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.646166980266571},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6318729519844055},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6265332698822021},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6231695413589478},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4917896091938019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48290419578552246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42697805166244507},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3779435157775879},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.37685757875442505},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3669348359107971},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10442748665809631}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6858565807342529},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.646166980266571},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6318729519844055},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6265332698822021},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6231695413589478},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4917896091938019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48290419578552246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42697805166244507},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3779435157775879},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.37685757875442505},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3669348359107971},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10442748665809631},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-45678-3_63","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45678-3_63","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:iris.uniroma1.it:11573/361621","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?eid=2-s2.0-33646140672&partnerID=65&md5=b2efff19264f526bc35b5fc02d933cfd","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W110251253","https://openalex.org/W1535011786","https://openalex.org/W1971427290","https://openalex.org/W1984953641","https://openalex.org/W1991466654","https://openalex.org/W2042345414","https://openalex.org/W2046285099","https://openalex.org/W2064072796","https://openalex.org/W2080725961","https://openalex.org/W2085579980","https://openalex.org/W2085637279","https://openalex.org/W2090879820","https://openalex.org/W2160641050","https://openalex.org/W2171350309","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W4387185483","https://openalex.org/W616034966","https://openalex.org/W2018146256","https://openalex.org/W2022506245","https://openalex.org/W4399175858","https://openalex.org/W2040572217","https://openalex.org/W2799386402"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}