{"id":"https://openalex.org/W3025809456","doi":"https://doi.org/10.1109/lwc.2020.3031717","title":"Minimizing the Installation Cost of Ground Stations in Satellite Networks: Complexity, Dynamic Programming and Approximation Algorithm","display_name":"Minimizing the Installation Cost of Ground Stations in Satellite Networks: Complexity, Dynamic Programming and Approximation Algorithm","publication_year":2020,"publication_date":"2020-10-16","ids":{"openalex":"https://openalex.org/W3025809456","doi":"https://doi.org/10.1109/lwc.2020.3031717","mag":"3025809456"},"language":"en","primary_location":{"id":"doi:10.1109/lwc.2020.3031717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lwc.2020.3031717","pdf_url":null,"source":{"id":"https://openalex.org/S2500830676","display_name":"IEEE Wireless Communications Letters","issn_l":"2162-2337","issn":["2162-2337","2162-2345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications Letters","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2005.07498","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Christos N. Efrem","orcid":"https://orcid.org/0000-0002-2285-837X"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Christos N. Efrem","raw_affiliation_strings":["School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece"],"raw_orcid":"https://orcid.org/0000-0002-2285-837X","affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"last","author":{"id":null,"display_name":"Athanasios D. Panagopoulos","orcid":"https://orcid.org/0000-0003-4716-3328"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Athanasios D. Panagopoulos","raw_affiliation_strings":["School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece"],"raw_orcid":"https://orcid.org/0000-0003-4716-3328","affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174458059"],"apc_list":null,"apc_paid":null,"fwci":9.7702,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.97479564,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"10","issue":"2","first_page":"378","last_page":"382"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12042","display_name":"Satellite Communication Systems","score":0.9768999814987183,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12042","display_name":"Satellite Communication Systems","score":0.9768999814987183,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T12449","display_name":"Spacecraft Design and Technology","score":0.0052999998442828655,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.0027000000700354576,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7019000053405762},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6421999931335449},{"id":"https://openalex.org/keywords/satellite","display_name":"Satellite","score":0.6147000193595886},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.42980000376701355},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4092999994754791},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.38850000500679016},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.34049999713897705},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.3361000120639801}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7019000053405762},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.657800018787384},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6421999931335449},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6233999729156494},{"id":"https://openalex.org/C19269812","wikidata":"https://www.wikidata.org/wiki/Q26540","display_name":"Satellite","level":2,"score":0.6147000193595886},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.42980000376701355},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4092999994754791},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.38850000500679016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37950000166893005},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30880001187324524},{"id":"https://openalex.org/C121308736","wikidata":"https://www.wikidata.org/wiki/Q149918","display_name":"Communications satellite","level":3,"score":0.30570000410079956},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.2989000082015991},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.2818000018596649},{"id":"https://openalex.org/C189069379","wikidata":"https://www.wikidata.org/wiki/Q218124","display_name":"Ground track","level":4,"score":0.28110000491142273},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.28110000491142273},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C2989135121","wikidata":"https://www.wikidata.org/wiki/Q1349167","display_name":"Ground station","level":3,"score":0.265500009059906}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lwc.2020.3031717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lwc.2020.3031717","pdf_url":null,"source":{"id":"https://openalex.org/S2500830676","display_name":"IEEE Wireless Communications Letters","issn_l":"2162-2337","issn":["2162-2337","2162-2345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications Letters","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2005.07498","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2005.07498","pdf_url":"https://arxiv.org/pdf/2005.07498","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2005.07498","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2005.07498","pdf_url":"https://arxiv.org/pdf/2005.07498","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1967000206","https://openalex.org/W2026891055","https://openalex.org/W2173965381","https://openalex.org/W2599618531","https://openalex.org/W2789284515","https://openalex.org/W2946692973","https://openalex.org/W2986765910","https://openalex.org/W2994735616","https://openalex.org/W3011540198","https://openalex.org/W4300550233","https://openalex.org/W6721297140"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"letter,":[2],"we":[3,37,52,61],"study":[4],"the":[5,21,40,86,89,94,98,101],"optimum":[6],"selection":[7],"of":[8,57,66,88,100],"ground":[9],"stations":[10],"(GSs)":[11],"in":[12,17],"RF/optical":[13],"satellite":[14],"networks":[15],"(SatNets)":[16],"order":[18],"to":[19],"minimize":[20],"overall":[22],"installation":[23],"cost":[24],"under":[25],"an":[26,76],"outage":[27],"probability":[28],"requirement,":[29],"assuming":[30],"independent":[31],"weather":[32],"conditions":[33],"between":[34],"sites.":[35],"First,":[36],"show":[38],"that":[39],"optimization":[41,71],"problem":[42],"can":[43],"be":[44],"formulated":[45],"as":[46,73,75],"a":[47,54,63],"binary-linear-programming":[48],"problem,":[49],"and":[50],"then":[51],"give":[53],"formal":[55],"proof":[56],"its":[58],"NP-hardness.":[59],"Furthermore,":[60],"design":[62],"dynamic-programming":[64],"algorithm":[65,80],"pseudo-polynomial":[67],"complexity":[68],"with":[69,81],"global":[70,95],"guarantee":[72,84],"well":[74],"efficient":[77],"(polynomial-time)":[78],"approximation":[79],"provable":[82],"performance":[83,99],"on":[85],"distance":[87],"achieved":[90],"objective":[91],"value":[92],"from":[93],"optimum.":[96],"Finally,":[97],"proposed":[102],"algorithms":[103],"is":[104],"verified":[105],"through":[106],"numerical":[107],"simulations.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2020-05-21T00:00:00"}
