{"id":"https://openalex.org/W2110399462","doi":"https://doi.org/10.1142/s0218195993000208","title":"DYNAMIC PROGRAMMING ON INTERVALS","display_name":"DYNAMIC PROGRAMMING ON INTERVALS","publication_year":1993,"publication_date":"1993-09-01","ids":{"openalex":"https://openalex.org/W2110399462","doi":"https://doi.org/10.1142/s0218195993000208","mag":"2110399462"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195993000208","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000208","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 &amp; 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/A5102080075","display_name":"Takao Asano","orcid":null},"institutions":[{"id":"https://openalex.org/I96679780","display_name":"Chuo University","ror":"https://ror.org/03qvqb743","country_code":"JP","type":"education","lineage":["https://openalex.org/I96679780"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"TAKAO ASANO","raw_affiliation_strings":["Department of Information and System Engineering, Chuo University, Kasuga, Bunkyo-ku, Tokyo 112, Japan","Department of Information and System Engineering, Chuo University, Kasuga, Bunkyo-ku, Tokyo 112, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and System Engineering, Chuo University, Kasuga, Bunkyo-ku, Tokyo 112, Japan","institution_ids":["https://openalex.org/I96679780"]},{"raw_affiliation_string":"Department of Information and System Engineering, Chuo University, Kasuga, Bunkyo-ku, Tokyo 112, Japan#TAB#","institution_ids":["https://openalex.org/I96679780"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102080075"],"corresponding_institution_ids":["https://openalex.org/I96679780"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.24390518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"03","issue":"03","first_page":"323","last_page":"330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9765999913215637,"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.9765999913215637,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9750000238418579,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9668999910354614,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/mathematics","display_name":"Mathematics","score":0.7877011299133301},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.7316381335258484},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6875619888305664},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6565957069396973},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5804644823074341},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5736758708953857},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48055294156074524},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.47735166549682617},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4548940062522888},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4471853971481323},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4360377788543701},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4357483983039856},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.4195397198200226},{"id":"https://openalex.org/keywords/circle-graph","display_name":"Circle graph","score":0.41408348083496094},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3827788829803467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2880951464176178},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.19063133001327515},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.14179348945617676},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.08019149303436279}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7877011299133301},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.7316381335258484},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6875619888305664},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6565957069396973},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5804644823074341},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5736758708953857},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48055294156074524},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.47735166549682617},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4548940062522888},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4471853971481323},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4360377788543701},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4357483983039856},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.4195397198200226},{"id":"https://openalex.org/C171528893","wikidata":"https://www.wikidata.org/wiki/Q5121450","display_name":"Circle graph","level":5,"score":0.41408348083496094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3827788829803467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2880951464176178},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.19063133001327515},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.14179348945617676},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.08019149303436279},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195993000208","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000208","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 &amp; 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":0,"referenced_works":[],"related_works":["https://openalex.org/W2282648397","https://openalex.org/W2316215962","https://openalex.org/W1842855190","https://openalex.org/W1570999420","https://openalex.org/W4390437815","https://openalex.org/W2048237851","https://openalex.org/W3021364183","https://openalex.org/W2127294000","https://openalex.org/W3141678720","https://openalex.org/W1541190831"],"abstract_inverted_index":{"We":[0,47],"consider":[1],"problems":[2],"on":[3,21],"intervals":[4,94],"which":[5],"can":[6,35],"be":[7,36],"solved":[8],"by":[9],"dynamic":[10,19],"programming.":[11],"Specifically,":[12],"we":[13],"give":[14],"an":[15,24,26,50,64,70],"efficient":[16],"implementation":[17],"of":[18,30,63,82,92],"programming":[20],"intervals.":[22],"As":[23],"application,":[25],"optimal":[27],"sequential":[28],"partition":[29],"a":[31,58,78,83],"graph":[32,66,85],"G=(V,":[33,67,86],"E)":[34],"obtained":[37],"in":[38],"O(m":[39,71],"log":[40,52,72],"n)":[41,53,73],"time,":[42],"where":[43],"n=|V|":[44],"and":[45,69],"m=|E|.":[46],"also":[48],"present":[49],"O(n":[51],"time":[54,74],"algorithm":[55,75],"for":[56,76],"finding":[57,77],"minimum":[59],"weight":[60,80],"dominating":[61],"set":[62],"interval":[65],"E),":[68,87],"maximum":[79],"clique":[81],"circular-arc":[84],"provided":[88],"their":[89],"intersection":[90],"models":[91],"n":[93],"(arcs)":[95],"are":[96],"given.":[97]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
