{"id":"https://openalex.org/W4226204011","doi":"https://doi.org/10.1587/transfun.2021dmp0017","title":"Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs","display_name":"Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs","publication_year":2022,"publication_date":"2022-03-08","ids":{"openalex":"https://openalex.org/W4226204011","doi":"https://doi.org/10.1587/transfun.2021dmp0017"},"language":"en","primary_location":{"id":"doi:10.1587/transfun.2021dmp0017","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transfun.2021dmp0017","pdf_url":"https://www.jstage.jst.go.jp/article/transfun/E105.A/9/E105.A_2021DMP0017/_pdf","source":{"id":"https://openalex.org/S166990724","display_name":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","issn_l":"0916-8508","issn":["0916-8508","1745-1337"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.jstage.jst.go.jp/article/transfun/E105.A/9/E105.A_2021DMP0017/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003248242","display_name":"Hiroshi Eto","orcid":"https://orcid.org/0000-0003-1456-1987"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroshi ETO","raw_affiliation_strings":["Tohoku University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tohoku University","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003089989","display_name":"Takehiro Ito","orcid":"https://orcid.org/0000-0002-9912-6898"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takehiro ITO","raw_affiliation_strings":["Tohoku University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tohoku University","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056566092","display_name":"Zhilong LIU","orcid":null},"institutions":[{"id":"https://openalex.org/I207014233","display_name":"Kyushu Institute of Technology","ror":"https://ror.org/02278tr80","country_code":"JP","type":"education","lineage":["https://openalex.org/I207014233"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Zhilong LIU","raw_affiliation_strings":["Kyushu Insitute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyushu Insitute of Technology","institution_ids":["https://openalex.org/I207014233"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057410359","display_name":"Eiji Miyano","orcid":"https://orcid.org/0000-0002-4260-7818"},"institutions":[{"id":"https://openalex.org/I207014233","display_name":"Kyushu Institute of Technology","ror":"https://ror.org/02278tr80","country_code":"JP","type":"education","lineage":["https://openalex.org/I207014233"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Eiji MIYANO","raw_affiliation_strings":["Kyushu Insitute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyushu Insitute of Technology","institution_ids":["https://openalex.org/I207014233"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1437,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.45486098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"E105.A","issue":"9","first_page":"1211","last_page":"1222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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.9951000213623047,"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.8216985464096069},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7277952432632446},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.6394373178482056},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5303516983985901},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5230777859687805},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5140787363052368},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.509720504283905},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5093334913253784},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5010695457458496},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.43883922696113586},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.43672478199005127},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4323671758174896},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.37923604249954224},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3694954514503479},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.11036151647567749},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0949459969997406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0661487877368927}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8216985464096069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7277952432632446},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6394373178482056},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5303516983985901},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5230777859687805},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5140787363052368},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.509720504283905},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5093334913253784},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5010695457458496},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.43883922696113586},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.43672478199005127},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4323671758174896},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.37923604249954224},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3694954514503479},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.11036151647567749},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0949459969997406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0661487877368927},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transfun.2021dmp0017","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transfun.2021dmp0017","pdf_url":"https://www.jstage.jst.go.jp/article/transfun/E105.A/9/E105.A_2021DMP0017/_pdf","source":{"id":"https://openalex.org/S166990724","display_name":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","issn_l":"0916-8508","issn":["0916-8508","1745-1337"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1587/transfun.2021dmp0017","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transfun.2021dmp0017","pdf_url":"https://www.jstage.jst.go.jp/article/transfun/E105.A/9/E105.A_2021DMP0017/_pdf","source":{"id":"https://openalex.org/S166990724","display_name":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","issn_l":"0916-8508","issn":["0916-8508","1745-1337"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3507407161","display_name":"Research on algorithms and data structures for solving theoretically hard problems in practical time","funder_award_id":"18H04091","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4072653567","display_name":"Research on Algorithms for Shortest Reconfiguration Capturing Detour Properties","funder_award_id":"19K11814","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4074647813","display_name":null,"funder_award_id":"JP19K11814","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4193626910","display_name":null,"funder_award_id":"JP21K11755","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G6450011259","display_name":"Algorithm Design for k-Constrained Combinatorial Optimization Problems","funder_award_id":"21K11755","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8458087533","display_name":null,"funder_award_id":"JP18H04091","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G908247422","display_name":null,"funder_award_id":"JP20H05793","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4226204011.pdf","grobid_xml":"https://content.openalex.org/works/W4226204011.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W20372564","https://openalex.org/W42852446","https://openalex.org/W1601088202","https://openalex.org/W1963707128","https://openalex.org/W1969719208","https://openalex.org/W1973310391","https://openalex.org/W1980842804","https://openalex.org/W1989539462","https://openalex.org/W2003665833","https://openalex.org/W2028357390","https://openalex.org/W2030087828","https://openalex.org/W2048237851","https://openalex.org/W2053648618","https://openalex.org/W2071807296","https://openalex.org/W2085155184","https://openalex.org/W2085716675","https://openalex.org/W2100432797","https://openalex.org/W2126186592","https://openalex.org/W2156760067","https://openalex.org/W2541167211","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W2898526288","https://openalex.org/W1554245510","https://openalex.org/W2897850773","https://openalex.org/W2952271241","https://openalex.org/W2963948964","https://openalex.org/W2139428469","https://openalex.org/W2049357728","https://openalex.org/W4225525972","https://openalex.org/W4308902224","https://openalex.org/W1983798870"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"generalized":[3],"variants":[4],"of":[5,29,39,46,52,74,84,93],"the":[6,12,50,72,91,94,135],"MAXIMUM":[7],"INDEPENDENT":[8],"SET":[9],"problem,":[10],"called":[11],"Maximum":[13],"Distance-d":[14],"Independent":[15],"Set":[16],"problem":[17,95],"(MaxDdIS":[18],"for":[19,43,127,149,166],"short).":[20],"For":[21,106],"an":[22,30,68],"integer":[23],"d\u22652,":[24],"a":[25,36,79,145,161],"distance-d":[26,81],"independent":[27,82],"set":[28,83],"unweighted":[31,69],"graph":[32,70],"G=(V,":[33],"E)":[34],"is":[35,61,76,117],"subset":[37],"S\u2286V":[38],"vertices":[40,47],"such":[41],"that":[42,158],"any":[44,55],"pair":[45],"u,":[48],"v\u2208S,":[49],"number":[51],"edges":[53],"in":[54,65],"path":[56],"between":[57],"u":[58],"and":[59,100,111,124,143],"v":[60],"at":[62],"least":[63],"d":[64],"G.":[66,85],"Given":[67],"G,":[71],"goal":[73],"MaxDdIS":[75,113,128,159],"to":[77,141],"find":[78],"maximum-cardinality":[80],"In":[86],"this":[87],"paper,":[88],"we":[89,156],"analyze":[90],"(in)approximability":[92],"on":[96,114,129,151],"r-regular":[97,115,130],"graphs":[98,116],"(r\u22653)":[99],"planar":[101,167],"graphs,":[102],"as":[103],"follows:":[104],"(1)":[105],"every":[107],"fixed":[108],"integers":[109],"d\u22653":[110],"r\u22653,":[112],"APX-hard.":[118],"(2)":[119],"We":[120,133],"design":[121],"polynomial-time":[122,146,162],"O(rd-1)-approximation":[123],"O(rd-2/d)-approximation":[125,137],"algorithms":[126,138],"graphs.":[131,153,168],"(3)":[132],"sharpen":[134],"above":[136],"when":[139],"restricted":[140],"d=r=3,":[142],"give":[144],"2-approximation":[147],"algorithm":[148],"MaxD3IS":[150],"cubic":[152],"(4)":[154],"Finally,":[155],"show":[157],"admits":[160],"approximation":[163],"scheme":[164],"(PTAS)":[165]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-13T07:31:44.756512","created_date":"2025-10-10T00:00:00"}