{"id":"https://openalex.org/W2989134466","doi":"https://doi.org/10.1142/s1793830920500123","title":"Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks","display_name":"Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks","publication_year":2019,"publication_date":"2019-11-13","ids":{"openalex":"https://openalex.org/W2989134466","doi":"https://doi.org/10.1142/s1793830920500123","mag":"2989134466"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830920500123","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500123","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and 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/A5018213450","display_name":"D. Pushparaj Shetty","orcid":"https://orcid.org/0000-0001-5246-8631"},"institutions":[{"id":"https://openalex.org/I11880225","display_name":"National Institute of Technology Karnataka","ror":"https://ror.org/01hz4v948","country_code":"IN","type":"education","lineage":["https://openalex.org/I11880225"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"D. Pushparaj Shetty","raw_affiliation_strings":["Department of Mathematical and Computational Sciences, National Institute of Technology Karnataka, Surathkal, Mangalore 575025, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical and Computational Sciences, National Institute of Technology Karnataka, Surathkal, Mangalore 575025, India","institution_ids":["https://openalex.org/I11880225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080673591","display_name":"M. Prasanna Lakshmi","orcid":null},"institutions":[{"id":"https://openalex.org/I11880225","display_name":"National Institute of Technology Karnataka","ror":"https://ror.org/01hz4v948","country_code":"IN","type":"education","lineage":["https://openalex.org/I11880225"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"M. Prasanna Lakshmi","raw_affiliation_strings":["Department of Mathematical and Computational Sciences, National Institute of Technology Karnataka, Surathkal, Mangalore 575025, India"],"raw_orcid":"https://orcid.org/0000-0002-3587-2189","affiliations":[{"raw_affiliation_string":"Department of Mathematical and Computational Sciences, National Institute of Technology Karnataka, Surathkal, Mangalore 575025, India","institution_ids":["https://openalex.org/I11880225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018213450"],"corresponding_institution_ids":["https://openalex.org/I11880225"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17065732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"12","issue":"01","first_page":"2050012","last_page":"2050012"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9998000264167786,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9998000264167786,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9994000196456909,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9986000061035156,"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/mathematics","display_name":"Mathematics","score":0.5122212767601013},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5073184370994568},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.44968268275260925},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42575469613075256},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42174553871154785},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.359210729598999},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3476320803165436},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34223484992980957},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11498618125915527}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5122212767601013},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5073184370994568},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.44968268275260925},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42575469613075256},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42174553871154785},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.359210729598999},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3476320803165436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34223484992980957},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11498618125915527},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830920500123","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500123","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W315629273","https://openalex.org/W1481854720","https://openalex.org/W1773631242","https://openalex.org/W1984273881","https://openalex.org/W2034019057","https://openalex.org/W2087251334","https://openalex.org/W2116995951","https://openalex.org/W2122343760","https://openalex.org/W2129893614","https://openalex.org/W2142928312","https://openalex.org/W2147717396","https://openalex.org/W2168452204","https://openalex.org/W2504987989"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W3212023493","https://openalex.org/W2090715877","https://openalex.org/W2572370460"],"abstract_inverted_index":{"The":[0],"minimum":[1,103],"power":[2,148],"assignment":[3,149],"problem":[4,31,66,93,112,135,167,206],"in":[5,52,213],"a":[6,47,53,137,147],"Wireless":[7],"Sensor":[8],"Network":[9],"(WSN)":[10],"is":[11,32,94,113,136],"to":[12,16,95,115],"assign":[13],"transmission":[14],"range":[15],"the":[17,20,27,44,72,77,179,221],"nodes":[18],"of":[19,46,59,79,140,187],"network":[21,74,101],"with":[22,56,67,102,154],"specified":[23],"connectivity":[24],"constraints":[25],"minimizing":[26],"total":[28],"power.":[29,104],"This":[30],"termed":[33],"as":[34],"Strong":[35],"Minimum":[36,84,105,119,194],"Energy":[37],"Topology":[38],"(SMET)":[39],"problem.":[40],"Fault":[41],"tolerance":[42],"addresses":[43],"issue":[45],"node":[48,125,200],"or":[49,81],"link":[50],"failure":[51],"WSN.":[54],"So,":[55],"an":[57,68,97,185],"objective":[58],"achieving":[60],"high":[61,82],"connectivity,":[62],"we":[63],"consider":[64],"SMET":[65],"additional":[69],"property,":[70],"i.e.,":[71],"resultant":[73],"must":[75],"satisfy":[76],"property":[78],"two":[80],"connectivity.":[83],"Power":[85,106,120,195],"[Formula:":[86,98,107,121,126,151,155,169,174,190,196,208,214,223,228,232],"see":[87,91,99,108,122,127,131,133,142,152,156,163,165,170,175,191,197,204,209,215,224,229,233],"text]-Connected":[88,109,128],"Subgraph":[89,110,129,202],"(MP[Formula:":[90,130,203],"text]CS)":[92,134],"contrive":[96],"text]-connected":[100],"(MP2CS)":[111],"proved":[114],"be":[116],"NP":[117],"-hard.":[118],"text]":[123,157,171,198,210,216,225,230],"Backbone":[124,199],"text]B[Formula:":[132,164],"special":[138],"case":[139,222],"MP[Formula:":[141,162],"text]CS":[143,166],"problem,":[144],"which":[145],"seeks":[146],"satisfying":[150],"text]-connectivity":[153,176],"backbone":[158,172],"nodes.":[159],"We":[160,182],"study":[161],"for":[168,193,207,220,226],"nodes,":[173],"and":[177,218,231],"derive":[178],"approximation":[180,188],"ratios.":[181],"also":[183],"propose":[184],"algorithm":[186],"ratio":[189],"text],":[192],"3-Connected":[201],"text]B3CS)":[205],"that":[211],"runs":[212],"time":[217],"generalize":[219],"any":[227],"text].":[234]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-02-26T06:29:33.603293","created_date":"2025-10-10T00:00:00"}