{"id":"https://openalex.org/W2377915845","doi":"https://doi.org/10.1007/s00453-016-0155-6","title":"The Maximum Labeled Path Problem","display_name":"The Maximum Labeled Path Problem","publication_year":2016,"publication_date":"2016-05-10","ids":{"openalex":"https://openalex.org/W2377915845","doi":"https://doi.org/10.1007/s00453-016-0155-6","mag":"2377915845"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-016-0155-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0155-6","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":true,"oa_status":"green","oa_url":"https://hal.science/hal-01769613","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020013590","display_name":"Basile Cou\u00ebtoux","orcid":null},"institutions":[{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Basile Cou\u00ebtoux","raw_affiliation_strings":["CNRS, LIF UMR 7279, Aix-Marseille Universit\u00e9, 13288, Marseille, France","ACRO - Algorithmique, Combinatoire et Recherche Op\u00e9rationnelle (France)"],"affiliations":[{"raw_affiliation_string":"CNRS, LIF UMR 7279, Aix-Marseille Universit\u00e9, 13288, Marseille, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I21491767"]},{"raw_affiliation_string":"ACRO - Algorithmique, Combinatoire et Recherche Op\u00e9rationnelle (France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064546442","display_name":"Elie Nakache","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Elie Nakache","raw_affiliation_strings":["CNRS, LIF UMR 7279, Aix-Marseille Universit\u00e9, 13288, Marseille, France","ACRO - Algorithmique, Combinatoire et Recherche Op\u00e9rationnelle (France)"],"affiliations":[{"raw_affiliation_string":"CNRS, LIF UMR 7279, Aix-Marseille Universit\u00e9, 13288, Marseille, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I21491767"]},{"raw_affiliation_string":"ACRO - Algorithmique, Combinatoire et Recherche Op\u00e9rationnelle (France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108138645","display_name":"Yann Vax\u00e8s","orcid":null},"institutions":[{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yann Vax\u00e8s","raw_affiliation_strings":["CNRS, LIF UMR 7279, Aix-Marseille Universit\u00e9, 13288, Marseille, France","ACRO - Algorithmique, Combinatoire et Recherche Op\u00e9rationnelle (France)"],"affiliations":[{"raw_affiliation_string":"CNRS, LIF UMR 7279, Aix-Marseille Universit\u00e9, 13288, Marseille, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I21491767"]},{"raw_affiliation_string":"ACRO - Algorithmique, Combinatoire et Recherche Op\u00e9rationnelle (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020013590"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I21491767"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.04912218,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"78","issue":"1","first_page":"298","last_page":"318"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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":0.9998999834060669,"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.9966999888420105,"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/T12288","display_name":"Optimization and Search Problems","score":0.9952999949455261,"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/combinatorics","display_name":"Combinatorics","score":0.7631241679191589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7377235293388367},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7341256141662598},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6498251557350159},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6434894800186157},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5900118947029114},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5826853513717651},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5491153001785278},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5419872403144836},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5206005573272705},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.47759532928466797},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4431711435317993},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4383845925331116},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40311428904533386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21078884601593018},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10720625519752502}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7631241679191589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7377235293388367},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7341256141662598},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6498251557350159},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6434894800186157},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5900118947029114},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5826853513717651},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5491153001785278},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5419872403144836},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5206005573272705},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.47759532928466797},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4431711435317993},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4383845925331116},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40311428904533386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21078884601593018},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10720625519752502},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-016-0155-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0155-6","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:HAL:hal-01769613v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01769613","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2017, 78 (1), pp.298 - 318. ⟨10.1007/s00453-016-0155-6⟩","raw_type":"Journal articles"},{"id":"pmh:oai:HAL:hal-02441598v1","is_oa":false,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-02441598","pdf_url":null,"source":{"id":"https://openalex.org/S4406922393","display_name":"HAL AMU","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":"ISSN: 0178-4617","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01769613v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01769613","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2017, 78 (1), pp.298 - 318. ⟨10.1007/s00453-016-0155-6⟩","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1578839709","https://openalex.org/W1999032440","https://openalex.org/W2017363428","https://openalex.org/W2048177396","https://openalex.org/W2085720608","https://openalex.org/W2090200648","https://openalex.org/W2095481180","https://openalex.org/W2139317321","https://openalex.org/W2141527743","https://openalex.org/W2156312014","https://openalex.org/W2176040808","https://openalex.org/W2595601445"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W2963411648","https://openalex.org/W1561811279","https://openalex.org/W1968988491","https://openalex.org/W1548167816","https://openalex.org/W1606488336","https://openalex.org/W2538178083","https://openalex.org/W1584635930","https://openalex.org/W2377915845"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}