{"id":"https://openalex.org/W2413067730","doi":"https://doi.org/10.1093/comnet/cnv020","title":"Network installation under convex costs","display_name":"Network installation under convex costs","publication_year":2015,"publication_date":"2015-07-21","ids":{"openalex":"https://openalex.org/W2413067730","doi":"https://doi.org/10.1093/comnet/cnv020","mag":"2413067730"},"language":"en","primary_location":{"id":"doi:10.1093/comnet/cnv020","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comnet/cnv020","pdf_url":null,"source":{"id":"https://openalex.org/S2531583244","display_name":"Journal of Complex Networks","issn_l":"2051-1310","issn":["2051-1310","2051-1329"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Complex Networks","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/A5071449494","display_name":"Alexander Gutfraind","orcid":"https://orcid.org/0000-0002-3324-2220"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alexander Gutfraind","raw_affiliation_strings":["Division of Epidemiology and Biostatistics, University of Illinois at Chicago, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"Division of Epidemiology and Biostatistics, University of Illinois at Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000938619","display_name":"Jeremy Kun","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy Kun","raw_affiliation_strings":["Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056036888","display_name":"\u00c1d\u00e1m D. Lelkes","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"\u00c1d\u00e1m D. Lelkes","raw_affiliation_strings":["Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081065957","display_name":"Lev Reyzin","orcid":"https://orcid.org/0000-0001-7443-6024"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lev Reyzin","raw_affiliation_strings":["Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I39422238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5071449494"],"corresponding_institution_ids":["https://openalex.org/I39422238"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.27843396,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":"2","first_page":"177","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"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/T12288","display_name":"Optimization and Search Problems","score":0.9952999949455261,"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/integer-programming","display_name":"Integer programming","score":0.6202579736709595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5546407699584961},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5492343306541443},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5426225662231445},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5375909805297852},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5292436480522156},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5286248922348022},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.502387523651123},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4722805917263031},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47182637453079224},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.43743646144866943},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.436083048582077},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36269229650497437},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3428712487220764},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32945871353149414},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.10902616381645203}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6202579736709595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5546407699584961},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5492343306541443},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5426225662231445},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5375909805297852},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5292436480522156},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5286248922348022},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.502387523651123},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4722805917263031},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47182637453079224},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.43743646144866943},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.436083048582077},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36269229650497437},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3428712487220764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32945871353149414},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.10902616381645203},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/comnet/cnv020","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comnet/cnv020","pdf_url":null,"source":{"id":"https://openalex.org/S2531583244","display_name":"Journal of Complex Networks","issn_l":"2051-1310","issn":["2051-1310","2051-1329"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Complex Networks","raw_type":"journal-article"},{"id":"pmh:oai:open-archive.highwire.org:comnet:4/2/177","is_oa":false,"landing_page_url":"http://comnet.oxfordjournals.org/cgi/content/short/4/2/177","pdf_url":null,"source":{"id":"https://openalex.org/S4406923041","display_name":"HighWire Press Open Archive","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"TEXT"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332382","display_name":"Oak Ridge Institute for Science and Education","ror":"https://ror.org/0526p1y61"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W128382845","https://openalex.org/W788200807","https://openalex.org/W1479863711","https://openalex.org/W1715975119","https://openalex.org/W1831934054","https://openalex.org/W1980334129","https://openalex.org/W1982687611","https://openalex.org/W1991488719","https://openalex.org/W2010912147","https://openalex.org/W2049287714","https://openalex.org/W2065000990","https://openalex.org/W2116087731","https://openalex.org/W2118714517","https://openalex.org/W2126186592","https://openalex.org/W2164094238","https://openalex.org/W2164543827","https://openalex.org/W2318771898","https://openalex.org/W3148587101"],"related_works":["https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2045237525","https://openalex.org/W189401716"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,18,24,34,59,88,115],"Neighbour-Aided":[3],"Network":[4],"Installation":[5],"Problem":[6],"(NANIP)":[7],"introduced":[8],"previously":[9],"which":[10],"asks":[11],"for":[12,87],"a":[13,21,28,31,82,93,102],"minimal":[14],"cost":[15,25,79],"ordering":[16],"of":[17,20,26,33,36,62,107],"nodes":[19],"graph,":[22],"where":[23],"visiting":[27],"node":[29],"is":[30,71],"function":[32],"number":[35],"its":[37,112],"neighbours":[38],"that":[39,68],"have":[40],"already":[41],"been":[42],"visited.":[43],"This":[44],"problem":[45,70],"has":[46],"applications":[47],"in":[48],"resource":[49],"management":[50],"and":[51,91,109],"disaster":[52],"recovery.":[53],"In":[54,64],"this":[55,69],"paper,":[56],"we":[57,66,100],"analyse":[58],"computational":[60],"hardness":[61],"NANIP.":[63],"particular":[65],"show":[67],"NP-hard":[72],"even":[73],"when":[74],"restricted":[75],"to":[76],"convex":[77],"decreasing":[78],"functions,":[80],"give":[81,101],"linear":[83],"approximation":[84,96],"lower":[85,97],"bound":[86],"greedy":[89],"algorithm,":[90],"prove":[92],"general":[94],"sub-constant":[95],"bound.":[98],"Then":[99],"new":[103],"integer":[104,117],"programming":[105],"formulation":[106],"NANIP":[108],"empirically":[110],"observe":[111],"speedup":[113],"over":[114],"original":[116],"programme.":[118]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}