{"id":"https://openalex.org/W3163147688","doi":"https://doi.org/10.1109/iiai-aai50415.2020.00177","title":"The maximum weighted k distance-d independent set problem on interval graph","display_name":"The maximum weighted k distance-d independent set problem on interval graph","publication_year":2020,"publication_date":"2020-09-01","ids":{"openalex":"https://openalex.org/W3163147688","doi":"https://doi.org/10.1109/iiai-aai50415.2020.00177","mag":"3163147688"},"language":"en","primary_location":{"id":"doi:10.1109/iiai-aai50415.2020.00177","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iiai-aai50415.2020.00177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 9th International Congress on Advanced Applied Informatics (IIAI-AAI)","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/A5083875317","display_name":"Yoshito Atsuta","orcid":null},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yoshito Atsuta","raw_affiliation_strings":["The University of Electro-Communications,Graduate School of Information Science and Engineering,Chofu,Japan","Graduate School of Information Science and Engineering, The University of Electro-Communications, Chofu, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Electro-Communications,Graduate School of Information Science and Engineering,Chofu,Japan","institution_ids":["https://openalex.org/I20529979"]},{"raw_affiliation_string":"Graduate School of Information Science and Engineering, The University of Electro-Communications, Chofu, Japan","institution_ids":["https://openalex.org/I20529979"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064612688","display_name":"Satoshi Takahashi","orcid":"https://orcid.org/0000-0001-5573-7841"},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Satoshi Takahashi","raw_affiliation_strings":["The University of Electro-Communications,Graduate School of Information Science and Engineering,Chofu,Japan","Graduate School of Information Science and Engineering, The University of Electro-Communications, Chofu, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Electro-Communications,Graduate School of Information Science and Engineering,Chofu,Japan","institution_ids":["https://openalex.org/I20529979"]},{"raw_affiliation_string":"Graduate School of Information Science and Engineering, The University of Electro-Communications, Chofu, Japan","institution_ids":["https://openalex.org/I20529979"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083875317"],"corresponding_institution_ids":["https://openalex.org/I20529979"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24237527,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"840","last_page":"841"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9861999750137329,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9800999760627747,"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/independent-set","display_name":"Independent set","score":0.7479287385940552},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.7321121692657471},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.641944408416748},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.641002893447876},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6297741532325745},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5496599674224854},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5473787784576416},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5425011515617371},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43266844749450684},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43125271797180176},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37476927042007446},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.260500967502594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22484633326530457},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13724592328071594}],"concepts":[{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.7479287385940552},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.7321121692657471},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.641944408416748},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.641002893447876},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6297741532325745},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5496599674224854},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5473787784576416},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5425011515617371},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43266844749450684},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43125271797180176},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37476927042007446},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.260500967502594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22484633326530457},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13724592328071594},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iiai-aai50415.2020.00177","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iiai-aai50415.2020.00177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 9th International Congress on Advanced Applied Informatics (IIAI-AAI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1481903965","https://openalex.org/W1544357472","https://openalex.org/W2011039300","https://openalex.org/W2038187727","https://openalex.org/W2092835661","https://openalex.org/W2541167211","https://openalex.org/W2789268215"],"related_works":["https://openalex.org/W3123958729","https://openalex.org/W2011576340","https://openalex.org/W2970277130","https://openalex.org/W2803082133","https://openalex.org/W3163147688","https://openalex.org/W4393023528","https://openalex.org/W2187700168","https://openalex.org/W2296729072","https://openalex.org/W2128873679","https://openalex.org/W4286907398"],"abstract_inverted_index":{"In":[0,55],"this":[1],"paper,":[2],"we":[3],"consider":[4],"a":[5,15,29,46,80],"maximum":[6,18,34],"weighted":[7,19,35,51],"k":[8,36,78,91],"distance-d":[9,20,37],"independent":[10,21,38,52],"set":[11,22,39,53],"problem,":[12],"which":[13],"is":[14,73],"variant":[16],"of":[17,59],"problems,":[23],"on":[24,41,45,83],"interval":[25,42],"graph.":[26],"We":[27],"propose":[28],"pseudo-polynomial":[30],"time":[31,86],"algorithm":[32,62],"for":[33],"problems":[40],"graphs,":[43],"based":[44],"solution":[47],"to":[48,69],"an":[49],"exact":[50],"problem.":[54],"addition,":[56],"the":[57,60,70,76,84],"performance":[58],"proposed":[61],"was":[63],"evaluated":[64],"by":[65],"computational":[66],"experiments.":[67],"According":[68],"experiments,":[71],"it":[72],"found":[74],"that":[75],"parameter":[77],"has":[79],"significant":[81],"influence":[82],"calculation":[85],"compared":[87],"with":[88],"parameters":[89],"d,":[90]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}