{"id":"https://openalex.org/W2411865288","doi":"https://doi.org/10.1109/tmc.2015.2475765","title":"The Minimum -Storage Problem: Complexity, Approximation, and Experimental Analysis","display_name":"The Minimum -Storage Problem: Complexity, Approximation, and Experimental Analysis","publication_year":2015,"publication_date":"2015-09-02","ids":{"openalex":"https://openalex.org/W2411865288","doi":"https://doi.org/10.1109/tmc.2015.2475765","mag":"2411865288"},"language":"en","primary_location":{"id":"doi:10.1109/tmc.2015.2475765","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2015.2475765","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Transactions on Mobile Computing","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/A5050291532","display_name":"Gianlorenzo D\u2019Angelo","orcid":"https://orcid.org/0000-0003-0377-7037"},"institutions":[{"id":"https://openalex.org/I4210150763","display_name":"Gran Sasso Science Institute","ror":"https://ror.org/043qcb444","country_code":"IT","type":"education","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210150763"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianlorenzo DAngelo","raw_affiliation_strings":["Gran Sasso Science Institute, Viale Crispi 7, L'Aquila, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Gran Sasso Science Institute, Viale Crispi 7, L'Aquila, Italy","institution_ids":["https://openalex.org/I4210150763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009426659","display_name":"Daniele Diodati","orcid":"https://orcid.org/0000-0002-3396-0265"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Daniele Diodati","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, Perugia, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023681870","display_name":"Alfredo Navarra","orcid":"https://orcid.org/0000-0001-8547-5934"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alfredo Navarra","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, Perugia, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066308534","display_name":"Cristina M. Pinotti","orcid":"https://orcid.org/0000-0002-8674-868X"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Cristina M. Pinotti","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, Perugia, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.677,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.77162409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"7","first_page":"1797","last_page":"1811"},"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.9983000159263611,"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.9983000159263611,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9970999956130981,"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.9948999881744385,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7599220275878906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6574651598930359},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5642677545547485},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5530411601066589},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5381311774253845},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5168648362159729},{"id":"https://openalex.org/keywords/computer-data-storage","display_name":"Computer data storage","score":0.4139918386936188},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39726847410202026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35512882471084595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2742314040660858}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7599220275878906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6574651598930359},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5642677545547485},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5530411601066589},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5381311774253845},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5168648362159729},{"id":"https://openalex.org/C194739806","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Computer data storage","level":2,"score":0.4139918386936188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39726847410202026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35512882471084595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2742314040660858},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tmc.2015.2475765","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2015.2475765","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Transactions on Mobile Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.7599999904632568}],"awards":[{"id":"https://openalex.org/G3301965435","display_name":null,"funder_award_id":"2010N5K7EB \u2018PRIN 2010\u2019","funder_id":"https://openalex.org/F4320320327","funder_display_name":"Anaesthetics Research Society"}],"funders":[{"id":"https://openalex.org/F4320320327","display_name":"Anaesthetics Research Society","ror":"https://ror.org/000twr676"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W72195406","https://openalex.org/W78230346","https://openalex.org/W143512583","https://openalex.org/W630423399","https://openalex.org/W774998647","https://openalex.org/W1456668920","https://openalex.org/W1587463421","https://openalex.org/W1966805076","https://openalex.org/W1989355565","https://openalex.org/W1991252512","https://openalex.org/W1991407520","https://openalex.org/W2003207175","https://openalex.org/W2004389393","https://openalex.org/W2006514056","https://openalex.org/W2010423603","https://openalex.org/W2021198281","https://openalex.org/W2029448190","https://openalex.org/W2044471216","https://openalex.org/W2046015200","https://openalex.org/W2050544369","https://openalex.org/W2067307840","https://openalex.org/W2075264255","https://openalex.org/W2076399305","https://openalex.org/W2091958238","https://openalex.org/W2101622070","https://openalex.org/W2110830275","https://openalex.org/W2124637492","https://openalex.org/W2125058377","https://openalex.org/W2128749719","https://openalex.org/W2137382266","https://openalex.org/W2137775453","https://openalex.org/W2149991184","https://openalex.org/W2153259545","https://openalex.org/W2159786721","https://openalex.org/W2165861038","https://openalex.org/W2167993212","https://openalex.org/W2401359599","https://openalex.org/W2490706771","https://openalex.org/W3142857871","https://openalex.org/W4243637616","https://openalex.org/W4254731264","https://openalex.org/W6995330276"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2404561224"],"abstract_inverted_index":{"In":[0,71],"a":[1,25,83,117,127,133,168],"sensor":[2],"network,":[3],"data":[4,15,47,59],"might":[5],"be":[6,114],"stored":[7],"in":[8,36,91],"so-called":[9],"storage":[10,34,50],"nodes,":[11,18],"which":[12],"receive":[13],"raw":[14,46],"from":[16,102,153],"other":[17],"compress":[19],"them,":[20],"and":[21,156,176],"send":[22],"them":[23],"toward":[24],"sink.":[26,62],"We":[27,95,106,124,137],"consider":[28],"the":[29,40,45,49,57,61,67,73,89,98,103,144,154,171,178],"problem":[30,74,90,101,166,175],"of":[31],"locating":[32],"k":[33],"nodes":[35,51],"order":[37],"to":[38,48,55,60,81,113,141,162,170],"minimize":[39],"energy":[41],"consumed":[42],"for":[43,183],"converging":[44],"as":[52,54,66],"well":[53],"converge":[56],"compressed":[58],"This":[63],"is":[64,75,111,160,167],"known":[65],"minimum":[68,99],"k-storage":[69,100],"problem.":[70],"general,":[72],"NP-hard.":[76],"However,":[77],"we":[78],"are":[79],"able":[80],"devise":[82],"polynomial-time":[84],"algorithm":[85,130,145],"that":[86,109,131,143,164],"optimally":[87],"solves":[88],"bounded-tree":[92],"width":[93],"graphs.":[94],"then":[96,125,177],"characterize":[97],"approximation":[104,135],"viewpoint.":[105],"first":[107],"prove":[108],"it":[110],"NP-hard":[112],"approximated":[115],"within":[116],"factor":[118],"smaller":[119],"than":[120],"1":[121],"+":[122],"1/e.":[123],"propose":[126],"local":[128],"search":[129],"guarantees":[132],"constant":[134],"factor.":[136],"conducted":[138],"extended":[139],"experiments":[140],"show":[142],"performs":[146],"very":[147,150],"well,":[148],"exhibiting":[149],"small":[151],"deviation":[152],"optimum":[155],"computational":[157],"time.":[158],"It":[159],"worth":[161],"note":[163],"our":[165],"generalization":[169],"well-known":[172],"metric":[173],"k-median":[174],"obtained":[179],"results":[180],"also":[181],"hold":[182],"this":[184],"case.":[185]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}