{"id":"https://openalex.org/W4407130604","doi":"https://doi.org/10.1109/icnp61940.2024.10858508","title":"Poster: An FPTAS for Shortest-Longest Path Problem","display_name":"Poster: An FPTAS for Shortest-Longest Path Problem","publication_year":2024,"publication_date":"2024-10-28","ids":{"openalex":"https://openalex.org/W4407130604","doi":"https://doi.org/10.1109/icnp61940.2024.10858508"},"language":"en","primary_location":{"id":"doi:10.1109/icnp61940.2024.10858508","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnp61940.2024.10858508","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 32nd International Conference on Network Protocols (ICNP)","raw_type":"proceedings-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/A5100326967","display_name":"Jianwei Zhang","orcid":"https://orcid.org/0000-0002-5491-1745"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jianwei Zhang","raw_affiliation_strings":["School of Information Science and Engineering, Yunnan University,Kunming,China,650500"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Yunnan University,Kunming,China,650500","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100354004","display_name":"Xin Li","orcid":"https://orcid.org/0000-0003-0348-5384"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xin Li","raw_affiliation_strings":["School of Information Science and Engineering, Yunnan University,Kunming,China,650500"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Yunnan University,Kunming,China,650500","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016939323","display_name":"B. Cui","orcid":"https://orcid.org/0000-0002-4844-9486"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bowen Cui","raw_affiliation_strings":["School of Information Science and Engineering, Yunnan University,Kunming,China,650500"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Yunnan University,Kunming,China,650500","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103069443","display_name":"Chunling Yang","orcid":"https://orcid.org/0000-0002-3918-1801"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chunling Yang","raw_affiliation_strings":["Zhejiang University,Information Technology Center,Hangzhou,China,310058"],"affiliations":[{"raw_affiliation_string":"Zhejiang University,Information Technology Center,Hangzhou,China,310058","institution_ids":["https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100326967"],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31162874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9142000079154968,"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/T12127","display_name":"Software System Performance and Reliability","score":0.9142000079154968,"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.6592076420783997},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5824265480041504},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5333226919174194},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5106688141822815},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.299144983291626},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21856853365898132},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05283713340759277}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6592076420783997},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5824265480041504},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5333226919174194},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5106688141822815},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.299144983291626},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21856853365898132},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05283713340759277}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnp61940.2024.10858508","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnp61940.2024.10858508","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 32nd International Conference on Network Protocols (ICNP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2030170468","https://openalex.org/W2160658249","https://openalex.org/W2892214318","https://openalex.org/W3086658297","https://openalex.org/W3148569179","https://openalex.org/W6864589567"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"multi-domain":[2],"Service":[3],"Function":[4],"Chain":[5],"(SFC)":[6],"orchestration,":[7],"we":[8],"define":[9],"the":[10,29],"Shortest-Longest":[11],"Path":[12],"(SLP)":[13],"problem,":[14],"prove":[15],"its":[16],"hardness,":[17],"and":[18,31],"design":[19],"an":[20,36],"efficient":[21],"Fully":[22],"Polynomial":[23],"Time":[24],"Approximation":[25],"Scheme":[26],"(FPTAS)":[27],"using":[28],"scaling":[30],"rounding":[32],"technique":[33],"to":[34],"compute":[35],"approximation":[37],"solution":[38],"with":[39],"provable":[40],"performance":[41],"guarantee.":[42]},"counts_by_year":[],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}