{"id":"https://openalex.org/W3018402451","doi":"https://doi.org/10.1007/s00453-021-00868-x","title":"Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem","display_name":"Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem","publication_year":2021,"publication_date":"2021-09-04","ids":{"openalex":"https://openalex.org/W3018402451","doi":"https://doi.org/10.1007/s00453-021-00868-x","mag":"3018402451"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-021-00868-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-021-00868-x","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/A5036594132","display_name":"Yuya Masumura","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuya Masumura","raw_affiliation_strings":["Fast Retailing Co., Ltd., Tokyo, 135-0063, Japan"],"affiliations":[{"raw_affiliation_string":"Fast Retailing Co., Ltd., Tokyo, 135-0063, Japan","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056811970","display_name":"Taihei Oki","orcid":"https://orcid.org/0000-0002-6862-9484"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Taihei Oki","raw_affiliation_strings":["The University of Tokyo, Tokyo, 113-8656, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo, Tokyo, 113-8656, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039274625","display_name":"Yutaro Yamaguchi","orcid":"https://orcid.org/0000-0002-1919-7195"},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yutaro Yamaguchi","raw_affiliation_strings":["Kyushu University, Fukuoka, 819-0395, Japan"],"affiliations":[{"raw_affiliation_string":"Kyushu University, Fukuoka, 819-0395, Japan","institution_ids":["https://openalex.org/I135598925"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039274625"],"corresponding_institution_ids":["https://openalex.org/I135598925"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4522,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65237929,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"83","issue":"12","first_page":"3681","last_page":"3714"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9977999925613403,"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.996999979019165,"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/treewidth","display_name":"Treewidth","score":0.794295072555542},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6508450508117676},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6493654251098633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6327717900276184},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5752993226051331},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5280107855796814},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5089643001556396},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.501152753829956},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4639657735824585},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.45761221647262573},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4494591951370239},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4408237338066101},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4314674437046051},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4291267991065979},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3320290446281433},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.25521764159202576},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23489460349082947},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22120311856269836},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10310667753219604}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.794295072555542},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6508450508117676},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6493654251098633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6327717900276184},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5752993226051331},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5280107855796814},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5089643001556396},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.501152753829956},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4639657735824585},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.45761221647262573},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4494591951370239},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4408237338066101},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4314674437046051},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4291267991065979},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3320290446281433},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.25521764159202576},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23489460349082947},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22120311856269836},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10310667753219604},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-021-00868-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-021-00868-x","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4699999988079071,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W120709761","https://openalex.org/W155897563","https://openalex.org/W412029480","https://openalex.org/W1503993426","https://openalex.org/W1520111182","https://openalex.org/W1521561776","https://openalex.org/W1640191719","https://openalex.org/W1656795039","https://openalex.org/W1988808425","https://openalex.org/W2054695963","https://openalex.org/W2085716675","https://openalex.org/W2092424636","https://openalex.org/W2131433460","https://openalex.org/W2134026356","https://openalex.org/W2148360835","https://openalex.org/W2150488380","https://openalex.org/W2914414140","https://openalex.org/W3044466045","https://openalex.org/W4241180678","https://openalex.org/W6724034425","https://openalex.org/W6724258321"],"related_works":["https://openalex.org/W1871156538","https://openalex.org/W2982372708","https://openalex.org/W4288088434","https://openalex.org/W2569940161","https://openalex.org/W3080792687","https://openalex.org/W2962819912","https://openalex.org/W4310650366","https://openalex.org/W4297686681","https://openalex.org/W3018402451","https://openalex.org/W2056155690"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}