{"id":"https://openalex.org/W2581245158","doi":"https://doi.org/10.1142/s0129054116500325","title":"On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs","display_name":"On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs","publication_year":2016,"publication_date":"2016-11-01","ids":{"openalex":"https://openalex.org/W2581245158","doi":"https://doi.org/10.1142/s0129054116500325","mag":"2581245158"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054116500325","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116500325","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","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/A5087923932","display_name":"Satoshi Fujita","orcid":"https://orcid.org/0000-0001-9412-7309"},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Satoshi Fujita","raw_affiliation_strings":["Institute of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739-8527, Japan"],"affiliations":[{"raw_affiliation_string":"Institute of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739-8527, Japan","institution_ids":["https://openalex.org/I113306721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087923932"],"corresponding_institution_ids":["https://openalex.org/I113306721"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19557876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":"07","first_page":"829","last_page":"843"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9894000291824341,"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.9876000285148621,"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/algorithm","display_name":"Algorithm","score":0.6759835481643677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5857785940170288},{"id":"https://openalex.org/keywords/unit-disk","display_name":"Unit disk","score":0.47799602150917053},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4361015558242798},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4120270907878876},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.3359822630882263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28755617141723633},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2781550884246826},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12244608998298645}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6759835481643677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5857785940170288},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.47799602150917053},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4361015558242798},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4120270907878876},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3359822630882263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28755617141723633},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2781550884246826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12244608998298645}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054116500325","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116500325","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1510363936","https://openalex.org/W2022082910","https://openalex.org/W2024884029","https://openalex.org/W2028738060","https://openalex.org/W2047496769","https://openalex.org/W2063572899","https://openalex.org/W2081811330","https://openalex.org/W2085887452","https://openalex.org/W2093381928","https://openalex.org/W2139023178","https://openalex.org/W2157054705","https://openalex.org/W2165275875","https://openalex.org/W2166237986","https://openalex.org/W3141863997"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2317200988","https://openalex.org/W2081283454","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W4285791829","https://openalex.org/W3171743256"],"abstract_inverted_index":{"A":[0],"connected":[1,17],"dominating":[2,12],"set":[3,13],"(CDS,":[4],"for":[5,7,33,93,126,160],"short)":[6],"graph":[8,146],"G":[9],"is":[10,56,97,142,168],"a":[11,16,30,44,74,82,101,108,113,143],"which":[14,37,89,104,161],"induces":[15],"subgraph":[18],"of":[19,28,46,81,85,151,164,178],"G.":[20],"In":[21],"this":[22],"paper,":[23],"we":[24,123],"consider":[25],"the":[26,69,78,105,119,162,165,183],"problem":[27,55],"finding":[29],"minimum":[31],"CDS":[32],"unit":[34,144],"disk":[35,145],"graphs,":[36],"have":[38,65],"recently":[39],"attracted":[40],"considerable":[41],"attention":[42],"as":[43],"model":[45],"virtual":[47],"backbone":[48],"in":[49,68,103,111,118],"multi-hop":[50],"wireless":[51],"networks.":[52],"This":[53,71],"optimization":[54],"known":[57,98],"to":[58,99,115,182],"be":[59,100,116],"NP-hard":[60],"and":[61,87,96,134],"many":[62],"approximation":[63],"algorithms":[64],"been":[66],"proposed":[67,92],"literature.":[70],"paper":[72],"proves":[73],"lower":[75],"bound":[76],"on":[77],"performance":[79],"ratio":[80],"greedy":[83,166],"algorithm":[84,167],"Guha":[86],"Khuller":[88],"was":[90],"originally":[91],"general":[94],"graphs":[95],"representative":[102],"lookahead":[106],"plays":[107],"crucial":[109],"role":[110],"selecting":[112],"vertex":[114],"contained":[117],"CDS.":[120],"More":[121],"specifically,":[122],"show":[124],"that":[125],"any":[127],"fixed":[128],"<mml:math":[129,136,154,172],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[130,137,155,173],"display=\"inline\"":[131,138,156,174],"overflow=\"scroll\"":[132,139,157,175],"altimg=\"eq-00001.gif\"><mml:mrow><mml:mi>\u03b5</mml:mi><mml:mo>&gt;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math>":[133],"integer":[135],"altimg=\"eq-00002.gif\"><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>\u2265</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math>,":[140],"there":[141],"with":[147],"bounded":[148],"degree":[149],"consisting":[150],"at":[152],"least":[153],"altimg=\"eq-00003.gif\"><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math>":[158],"vertices":[159],"output":[163],"no":[169],"better":[170],"than":[171],"altimg=\"eq-00004.gif\"><mml:mrow><mml:mn>3</mml:mn><mml:mo>\u2212</mml:mo><mml:mi>\u03b5</mml:mi></mml:mrow></mml:math>":[176],"times":[177],"an":[179],"optimum":[180],"solution":[181],"same":[184],"graph.":[185]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}