{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:50:58Z","timestamp":1740171058955,"version":"3.37.3"},"reference-count":16,"publisher":"Oxford University Press (OUP)","issue":"2","funder":[{"DOI":"10.13039\/100006229","name":"ORISE","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100006229","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CPLEX"},{"name":"IBM Academic Initiative program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcomplexnetw"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1093\/comnet\/cnv020","type":"journal-article","created":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T22:59:42Z","timestamp":1437519582000},"page":"177-186","source":"Crossref","is-referenced-by-count":1,"title":["Network installation under convex costs"],"prefix":"10.1093","volume":"4","author":[{"given":"Alexander","family":"Gutfraind","sequence":"first","affiliation":[]},{"given":"Jeremy","family":"Kun","sequence":"additional","affiliation":[]},{"given":"\u00c1d\u00e1m D.","family":"Lelkes","sequence":"additional","affiliation":[]},{"given":"Lev","family":"Reyzin","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"key":"2016060808072583000_4.2.177.1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu033"},{"key":"2016060808072583000_4.2.177.2","doi-asserted-by":"crossref","unstructured":"Guha S. , Moss A. , (Seffi) Naor J. , Schieber B. (1999) Efficient recovery from power outage (extended abstract). In Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, STOC\u201999. New York, NY: ACM, pp. 574\u2013582.","DOI":"10.1145\/301250.301406"},{"key":"2016060808072583000_4.2.177.3","unstructured":"Nurre S. G. , Sharkey T. C. (2010) Restoring infrastructure systems: an integrated network design and scheduling problem. In Proceedings of the 2010 Industrial Engineering Research Conference, Canc\u00fan, Mexico."},{"key":"2016060808072583000_4.2.177.4","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2007.905859"},{"key":"2016060808072583000_4.2.177.5","doi-asserted-by":"publisher","DOI":"10.1109\/59.317561"},{"key":"2016060808072583000_4.2.177.6","unstructured":"Bertoli P. , Cimatti R. , Slaney J. , Thibaux S. (2002) Solving power supply restoration problems with planning via symbolic model checking. In AIPS-02 Workshop on Planning via Model-Checking, pp. 576\u2013580."},{"key":"2016060808072583000_4.2.177.7","doi-asserted-by":"crossref","unstructured":"Coffrin C. , Van Hentenryck P. , Bent R. (2011) Strategic stockpiling of power system supplies for disaster recovery. In Power and Energy Society General Meeting. San Diego, CA, USA: IEEE, pp. 1\u20138.","DOI":"10.1109\/PES.2011.6039414"},{"key":"2016060808072583000_4.2.177.8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13520-0_35"},{"key":"2016060808072583000_4.2.177.9","doi-asserted-by":"crossref","unstructured":"Held M. , Karp R. M. (1961) A dynamic programming approach to sequencing problems. In ACM \u201961: Proceedings of the 1961 16th ACM National Meeting. New York, NY: ACM, pp. 71.201\u201371.204.","DOI":"10.1145\/800029.808532"},{"key":"2016060808072583000_4.2.177.10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02206819"},{"key":"2016060808072583000_4.2.177.11","unstructured":"West D. B. (2001) Introduction to Graph Theory. NJ: Pearson Prentice Hall."},{"key":"2016060808072583000_4.2.177.12","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)12001-5"},{"key":"2016060808072583000_4.2.177.13","doi-asserted-by":"crossref","unstructured":"Downey R. G. , Fellows M. R. (2013) Fundamentals of Parameterized Complexity. Texts in Computer Science. Berlin, Heidelberg, New York: Springer.","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"2016060808072583000_4.2.177.14","doi-asserted-by":"crossref","unstructured":"Zuckerman D. (2006) Linear degree extractors and the inapproximability of max clique and chromatic number, In Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, STOC\u201906. New York, NY: ACM, pp. 681\u2013690.","DOI":"10.1145\/1132516.1132612"},{"key":"2016060808072583000_4.2.177.15","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fizikai Lapok"},{"key":"2016060808072583000_4.2.177.16","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/4\/2\/177\/6716427\/cnv020.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T04:57:16Z","timestamp":1503550636000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article-lookup\/doi\/10.1093\/comnet\/cnv020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":16,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2016,6,8]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1093\/comnet\/cnv020"],"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnv020","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"type":"print","value":"2051-1310"},{"type":"electronic","value":"2051-1329"}],"subject":[],"published":{"date-parts":[[2015,7,21]]}}}