{"id":"https://openalex.org/W2066450989","doi":"https://doi.org/10.1007/s00453-012-9656-0","title":"On Finding Min-Min Disjoint Paths","display_name":"On Finding Min-Min Disjoint Paths","publication_year":2012,"publication_date":"2012-05-17","ids":{"openalex":"https://openalex.org/W2066450989","doi":"https://doi.org/10.1007/s00453-012-9656-0","mag":"2066450989"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9656-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9656-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5013126405","display_name":"Longkun Guo","orcid":"https://orcid.org/0000-0003-2891-4253"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Longkun Guo","raw_affiliation_strings":["School of Mathematics and Computer Science, Fuzhou University, Fuzhou, China","School of Mathematics and Computer Science, Fuzhou University,Fuzhou,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Computer Science, Fuzhou University, Fuzhou, China","institution_ids":["https://openalex.org/I80947539"]},{"raw_affiliation_string":"School of Mathematics and Computer Science, Fuzhou University,Fuzhou,China","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070128994","display_name":"Hong Shen","orcid":"https://orcid.org/0000-0002-3663-6591"},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]},{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU","CN"],"is_corresponding":true,"raw_author_name":"Hong Shen","raw_affiliation_strings":["School of Computer Science, University of Adelaide, Adelaide, Australia","School of Computer and Information Technology, Beijing Jiaotong University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"School of Computer and Information Technology, Beijing Jiaotong University, Beijing, China","institution_ids":["https://openalex.org/I21193070"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070128994"],"corresponding_institution_ids":["https://openalex.org/I21193070","https://openalex.org/I5681781"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.3799,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.88923208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"66","issue":"3","first_page":"641","last_page":"653"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9944000244140625,"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/combinatorics","display_name":"Combinatorics","score":0.827616810798645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6288571357727051},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5911394953727722},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5804377794265747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5642006993293762},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48958930373191833},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4862131178379059},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4808448255062103},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4492708742618561},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4478757977485657},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.44478803873062134},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4213332533836365},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4068099856376648},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1777631938457489},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.17532917857170105}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.827616810798645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6288571357727051},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5911394953727722},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5804377794265747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5642006993293762},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48958930373191833},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4862131178379059},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4808448255062103},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4492708742618561},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4478757977485657},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.44478803873062134},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4213332533836365},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4068099856376648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1777631938457489},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.17532917857170105},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-012-9656-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9656-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/78994","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/78994","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1007/s00453-012-9656-0","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":21,"referenced_works":["https://openalex.org/W161149752","https://openalex.org/W1622251338","https://openalex.org/W1958473923","https://openalex.org/W1967565181","https://openalex.org/W1976285925","https://openalex.org/W1995549216","https://openalex.org/W1997556033","https://openalex.org/W2011039300","https://openalex.org/W2012969943","https://openalex.org/W2019637647","https://openalex.org/W2021673830","https://openalex.org/W2030087828","https://openalex.org/W2032753014","https://openalex.org/W2060765530","https://openalex.org/W2101234060","https://openalex.org/W2113963729","https://openalex.org/W2128090945","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2493461785","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W2906860838","https://openalex.org/W1561811279","https://openalex.org/W2963411648","https://openalex.org/W2147954430","https://openalex.org/W2016001296","https://openalex.org/W2019123979","https://openalex.org/W3125240838","https://openalex.org/W2031552172"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}