{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:52:14Z","timestamp":1773330734610,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T00:00:00Z","timestamp":1514332800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10878-017-0241-y","type":"journal-article","created":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T17:26:46Z","timestamp":1514395606000},"page":"895-905","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Complexity and inapproximability results for the Power Edge Set problem"],"prefix":"10.1007","volume":"35","author":[{"given":"Sonia","family":"Toubaline","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"D\u2019Ambrosio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Louis","family":"Poirion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,27]]},"reference":[{"key":"241_CR1","unstructured":"Aazami A (2008) Hardness results and approximation algorithms for some problems on graphs. Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada"},{"key":"241_CR2","first-page":"1","volume-title":"Approximation, randomization, and combinatorial optimization: algorithms and techniques, volume 4627 of lecture notes in computer science","author":"A Aazami","year":"2007","unstructured":"Aazami A, Stilp M (2007) Approximation algorithms and hardness for domination with propagation. In: Charikar M, Jansen K, Reingold O, Rolim J (eds) Approximation, randomization, and combinatorial optimization: algorithms and techniques, volume 4627 of lecture notes in computer science. Springer, Berlin, pp 1\u201315"},{"issue":"3","key":"241_CR3","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/S0895480103432556","volume":"19","author":"DJ Brueni","year":"2005","unstructured":"Brueni DJ, Heath LS (2005) The PMU placement problem. SIAM J Discrete Math 19(3):744\u2013761","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"241_CR4","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439\u2013485","journal-title":"Ann Math"},{"issue":"6","key":"241_CR5","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1016\/j.dam.2005.08.006","volume":"154","author":"M Dorfling","year":"2006","unstructured":"Dorfling M, Henning MA (2006) A note on power domination in grid graphs. Discrete Appl Math 154(6):1023\u20131027","journal-title":"Discrete Appl Math"},{"issue":"1","key":"241_CR6","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/TPWRS.2009.2036474","volume":"25","author":"R Emami","year":"2010","unstructured":"Emami R, Abur A (2010) Robust measurement design by placing synchronized phasor measurements on network branches. IEEE Trans Power Syst 25(1):38\u201343","journal-title":"IEEE Trans Power Syst"},{"key":"241_CR7","unstructured":"Emami R,\u00a0Abur A,\u00a0Galvan F (2008) Optimal placement of phasor measurements for enhanced state estimation: a case study. In: 16th Power systems computation conference. IEEE, Piscataway, pp 923\u2013928"},{"key":"241_CR8","unstructured":"Feige U (2003) Vertex cover is hardest to approximate on regular graphs. Technical Report MCS03-15, Weizmann Institute"},{"key":"241_CR9","first-page":"172","volume-title":"Fundamentals of computation theory, volume 3623 of lecture notes in computer science","author":"J Guo","year":"2005","unstructured":"Guo J, Niedermeier R, Raible D (2005) Improved algorithms and complexity results for power domination in graphs. In: Li\u015bkiewicz M, Reischuk R (eds) Fundamentals of computation theory, volume 3623 of lecture notes in computer science. Springer, Berlin, pp 172\u2013184"},{"issue":"4","key":"241_CR10","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes TW, Hedetniemi SM, Hedetniemi ST, Henning MA (2002) Domination in graphs applied to electric power networks. SIAM J Discrete Math 15(4):519\u2013529","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"241_CR11","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/S0097539795286612","volume":"28","author":"S Khanna","year":"1999","unstructured":"Khanna S, Motwani R, Sudan M, Vazirani U (1999) On syntactic versus computational views of approximability. SIAM J Comput 28(1):164\u2013191","journal-title":"SIAM J Comput"},{"issue":"2","key":"241_CR12","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1109\/TPWRS.2011.2179816","volume":"27","author":"NM Manousakis","year":"2012","unstructured":"Manousakis NM, Korre GN, Georgilakis PS (2012) Taxonomy of PMU placement methodologies. IEEE Trans Power Syst 27(2):1070\u20131077","journal-title":"IEEE Trans Power Syst"},{"issue":"7","key":"241_CR13","doi-asserted-by":"crossref","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","volume":"428","author":"Minimum Rank-Special Graphs Work Group","year":"2008","unstructured":"Minimum Rank-Special Graphs Work Group (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Its Appl 428(7):1628\u20131648","journal-title":"Linear Algebra Its Appl"},{"issue":"2","key":"241_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0304-3975(91)90159-Y","volume":"84","author":"S Moran","year":"1991","unstructured":"Moran S, Wolfstahl Y (1991) Optimal covering of cacti by vertex-disjoint paths. Theor Comput Sci 84(2):179\u2013197","journal-title":"Theor Comput Sci"},{"issue":"2","key":"241_CR15","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.21684","volume":"68","author":"PL Poirion","year":"2016","unstructured":"Poirion PL, Toubaline S, D\u2019Ambrosio C, Liberti L (2016) The power edge set problem. Networks 68(2):104\u2013120","journal-title":"Networks"},{"issue":"1\u20133","key":"241_CR16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.tcs.2006.04.011","volume":"359","author":"G Xu","year":"2006","unstructured":"Xu G, Kang L, Shan E, Zhao M (2006) Power domination in block graphs. Theor Comput Sci 359(1\u20133):299\u2013305","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0241-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0241-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0241-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T05:25:05Z","timestamp":1521177905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0241-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,27]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["241"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0241-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,27]]}}}