{"id":"https://openalex.org/W4404415434","doi":"https://doi.org/10.1142/s0218195924500031","title":"An Efficient Algorithm for the 2-Central Path Problem","display_name":"An Efficient Algorithm for the 2-Central Path Problem","publication_year":2024,"publication_date":"2024-06-01","ids":{"openalex":"https://openalex.org/W4404415434","doi":"https://doi.org/10.1142/s0218195924500031"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195924500031","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0218195924500031","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","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/A5037816092","display_name":"Ziyun Huang","orcid":"https://orcid.org/0000-0003-3484-7907"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ziyun Huang","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Penn State Erie, The Behrend College, Erie, Pennsylvania 16509, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Penn State Erie, The Behrend College, Erie, Pennsylvania 16509, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000279591","display_name":"Yongding Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yongding Zhu","raw_affiliation_strings":["Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, New York 14260, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, New York 14260, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006945148","display_name":"Jinhui Xu","orcid":"https://orcid.org/0000-0001-5730-9429"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jinhui Xu","raw_affiliation_strings":["Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, New York 14260, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, New York 14260, USA","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037816092"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29851533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"01n02","first_page":"43","last_page":"61"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9508000016212463,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9508000016212463,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9463000297546387,"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.9398999810218811,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/path","display_name":"Path (computing)","score":0.5616461634635925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5040637254714966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49478834867477417}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5616461634635925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5040637254714966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49478834867477417},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195924500031","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0218195924500031","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W196862470","https://openalex.org/W1492998720","https://openalex.org/W2014732796","https://openalex.org/W2020590137","https://openalex.org/W2021816456","https://openalex.org/W2046812523","https://openalex.org/W2052051124","https://openalex.org/W2055275666","https://openalex.org/W2067045410","https://openalex.org/W2097004206","https://openalex.org/W2097245136","https://openalex.org/W2161779238","https://openalex.org/W2175621835","https://openalex.org/W4251847323","https://openalex.org/W4252017042"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"In":[0,69,97],"this":[1,70],"paper":[2],"we":[3,72,99],"consider":[4],"the":[5,26,126,174,182,193,206],"following":[6],"[Formula:":[7,17,22,31,35,39,49,77,81,94,105,109,116,120,130,136,157,161,165,170,178,189,198,202,224,228],"see":[8,18,23,32,36,40,50,78,82,95,106,110,113,117,121,131,137,158,162,166,171,179,190,199,203,225,229],"text]-Central":[9],"Path":[10],"Problem":[11],"(2CPP):":[12],"Given":[13],"a":[14,57],"set":[15],"of":[16,60,115,177,185,195],"text]":[19,24,33,79,83,107,111,118,122,132,138,159,163,167,172,180,191,204,230],"polygonal":[20],"curves":[21,30,47,134,196],"in":[25,48,87,135,164,197,232],"plane,":[27],"find":[28],"two":[29],"and":[34,56,80,108,119,160,187,201,216],"text],":[37,200],"called":[38],"text]-central":[41],"paths,":[42],"that":[43,76,101,125],"best":[44,92],"represent":[45,93],"all":[46],"text].":[51,96],"Despite":[52],"its":[53],"theoretical":[54],"interest":[55],"wide":[58],"range":[59],"practical":[61],"applications,":[62],"2CPP":[63,149],"has":[64],"not":[65],"been":[66],"well":[67],"studied.":[68],"paper,":[71],"first":[73],"establish":[74],"criteria":[75],"ought":[84],"to":[85,91,133,147],"meet":[86],"order":[88],"for":[89],"them":[90],"particular,":[98],"require":[100],"there":[102],"exists":[103],"parametrizations":[104],"([Formula:":[112],"text])":[114,226],"respectively":[123],"such":[124],"maximum":[127],"distance":[128],"from":[129],"is":[139,145,173,192,205,217],"minimized.":[140],"Then":[141],"an":[142],"efficient":[143],"algorithm":[144,155,211],"presented":[146],"solve":[148],"under":[150],"certain":[151],"realistic":[152],"assumptions.":[153],"Our":[154,210],"constructs":[156],"time,":[168],"where":[169],"total":[175,183],"complexity":[176],"(i.e.,":[181],"number":[184,194],"vertices":[186],"edges),":[188],"inverse":[207],"Ackermann":[208],"function.":[209],"uses":[212],"parametric":[213],"search":[214],"technique":[215],"considerably":[218],"faster":[219],"than":[220],"arrangement-related":[221],"algorithms":[222],"(i.e.":[223],"when":[227],"as":[231],"most":[233],"real":[234],"applications.":[235]},"counts_by_year":[],"updated_date":"2025-12-19T19:40:27.379048","created_date":"2025-10-10T00:00:00"}