{"id":"https://openalex.org/W2153541028","doi":"https://doi.org/10.1109/glocom.2004.1378118","title":"An efficient heuristic algorithm for 2D h-hops range assignment problem","display_name":"An efficient heuristic algorithm for 2D h-hops range assignment problem","publication_year":2005,"publication_date":"2005-04-05","ids":{"openalex":"https://openalex.org/W2153541028","doi":"https://doi.org/10.1109/glocom.2004.1378118","mag":"2153541028"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2004.1378118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2004.1378118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5002203026","display_name":"Gautam Das","orcid":"https://orcid.org/0000-0002-4627-9065"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"G.K. Das","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012476636","display_name":"Sasthi C. Ghosh","orcid":"https://orcid.org/0000-0002-3444-0333"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S.C. Ghosh","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032341988","display_name":"Subhas C. Nandy","orcid":"https://orcid.org/0000-0003-0330-2891"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S.C. Nandy","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I6498739"],"apc_list":null,"apc_paid":null,"fwci":0.3923,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.62071311,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"2","issue":null,"first_page":"1051","last_page":"1055"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9965999722480774,"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.9965999722480774,"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/T12288","display_name":"Optimization and Search Problems","score":0.9941999912261963,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7002277970314026},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6077533960342407},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5112075805664062},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4979386329650879},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4351791739463806},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35750818252563477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15664121508598328},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13317203521728516},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09369760751724243}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7002277970314026},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6077533960342407},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5112075805664062},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4979386329650879},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4351791739463806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35750818252563477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15664121508598328},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13317203521728516},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09369760751724243},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2004.1378118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2004.1378118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1483484469","https://openalex.org/W1552092932","https://openalex.org/W1765492253","https://openalex.org/W1986530072","https://openalex.org/W2015356474","https://openalex.org/W2038603123","https://openalex.org/W2065845152","https://openalex.org/W2087983778","https://openalex.org/W2092910894","https://openalex.org/W2107421266","https://openalex.org/W2142962400","https://openalex.org/W2150852281","https://openalex.org/W2163219774","https://openalex.org/W2480336462","https://openalex.org/W2752885492","https://openalex.org/W3135696298","https://openalex.org/W4246219036","https://openalex.org/W6637913041","https://openalex.org/W6654224958"],"related_works":["https://openalex.org/W303980170","https://openalex.org/W2351491280","https://openalex.org/W2386767533","https://openalex.org/W2371447506","https://openalex.org/W2333698505","https://openalex.org/W2153913439","https://openalex.org/W1981277176","https://openalex.org/W1967523843","https://openalex.org/W3028444640","https://openalex.org/W2544261895"],"abstract_inverted_index":{"Given":[0],"a":[1,8],"set":[2],"S":[3,27,33,41,58],"of":[4,32,50,82,95,130,149,161,190],"n":[5],"radio-stations":[6],"on":[7,79,211],"2D":[9,63],"plane":[10],"and":[11,47,98,207],"an":[12,100,174],"integer":[13],"h,":[14],"the":[15,24,48,55,96,110,114,127,138,146,150,158,179,188,191],"range":[16,65,115,152,182,189],"assignment":[17,66,153,183],"problem":[18,67,97,154,184],"is":[19,59,68,120],"to":[20,23,70,117],"assign":[21],"ranges":[22],"members":[25,39,56],"in":[26,40,57,133,137,167,185],"such":[28],"that":[29,201],"each":[30,118],"member":[31],"can":[34,125,164],"communicate":[35],"with":[36],"all":[37,54],"other":[38],"using":[42],"at":[43],"most":[44],"h":[45],"hops,":[46],"sum":[49],"powers":[51],"required":[52],"for":[53,105,178],"minimized.":[60],"The":[61],"general":[62,180],"h-hop":[64,181],"known":[69],"be":[71,165,196],"NP-hard":[72],"(A.E.F.":[73],"Clementi":[74],"et":[75],"al,":[76],"Proc.":[77],"Symp.":[78],"Theor.":[80],"Aspects":[81],"Comp.":[83],"Sci.":[84],"(STACS-00),":[85],"pp.":[86],"651-660,":[87],"2000).":[88],"We":[89],"first":[90],"consider":[91,145],"some":[92],"simplified":[93],"variations":[94],"propose":[99,173],"efficient":[101,175],"polynomial":[102],"time":[103,136],"algorithm":[104,177,204],"obtaining":[106],"optimal":[107,159],"solution.":[108],"In":[109,141],"homogeneous":[111,151],"version,":[112],"where":[113,187],"assigned":[116],"radio-station":[119],"same":[121],"(/spl":[122],"rho/),":[123],"we":[124,144,172],"obtain":[126],"minimum":[128],"value":[129,160],"/spl":[131,162],"rho/":[132,163],"O(n/sup":[134,168],"3/logn)":[135],"worst":[139],"case.":[140],"addition,":[142],"if":[143],"unbounded":[147],"version":[148],"(i.e.":[155],"h=n-1),":[156],"then":[157],"obtained":[166],"2/logn)":[169],"time.":[170],"Finally,":[171],"heuristic":[176,203],"2D,":[186],"radio":[192],"stations":[193],"may":[194],"not":[195],"equal.":[197],"Experimental":[198],"results":[199],"demonstrate":[200],"our":[202],"runs":[205],"fast":[206],"produces":[208],"near-optimal":[209],"solutions":[210],"randomly":[212],"generated":[213],"instances.":[214]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}