{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:46:20Z","timestamp":1742971580526,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711492"},{"type":"electronic","value":"9783319711508"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71150-8_17","type":"book-chapter","created":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T00:48:21Z","timestamp":1510793301000},"page":"180-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["New Insights for Power Edge Set Problem"],"prefix":"10.1007","author":[{"given":"Benoit","family":"Darties","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annie","family":"Chateau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodolphe","family":"Giroudeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,17]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. In: Proceedings of the Annual IEEE Conference on Computational Complexity, pp. 74\u201380 (2009)","DOI":"10.1109\/CCC.2009.38"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Darties, B., Chateau, A., Giroudeau, R., Weller, M.: Improved complexity for power edge set problem. In: 28th International Workshop on Combinatorial Algorithms (2017)","DOI":"10.1007\/978-3-319-71150-8_17"},{"issue":"6","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1016\/j.dam.2005.08.006","volume":"154","author":"M Dorfling","year":"2006","unstructured":"Dorfling, M., Henning, M.: A note on power domination in grid graphs. Discr. Appl. Math. 154(6), 1023\u20131027 (2006)","journal-title":"Discr. Appl. Math."},{"key":"17_CR4","unstructured":"Feige, U.: Vertex cover is hardest to approximate on regular graphs. Technical report MCS03-15, the Weizmann Institute (2003)"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1109\/TPWRS.2008.926475","volume":"23","author":"B Gou","year":"2008","unstructured":"Gou, B.: Generalized integer linear programming formulation for optimal PMU placement. IEEE Trans. Power Syst. 23(3), 1099\u20131104 (2008)","journal-title":"IEEE Trans. Power Syst."},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discr. Math. 15(4), 519\u2013529 (2002)","journal-title":"SIAM J. Discr. Math."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of $$k$$-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"8","key":"17_CR8","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1002\/wcm.356","volume":"5","author":"Y Li","year":"2005","unstructured":"Li, Y., Thai, M.T., Wang, F., Yi, C., Wan, P., Du, D.: On greedy construction of connected dominating sets in wireless networks. Wirel. Commun. Mobile Comput. 5(8), 927\u2013932 (2005)","journal-title":"Wirel. Commun. Mobile Comput."},{"key":"17_CR9","first-page":"41","volume":"105","author":"D Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 105, 41\u201372 (2011)","journal-title":"Bull. EATCS"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C Papadimitriou","year":"1991","unstructured":"Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1002\/net.21684","volume":"68","author":"P Poirion","year":"2016","unstructured":"Poirion, P., Toubaline, S., D\u2019Ambrosio, C., Liberti, L.: The power edge set problem. Networks 68(2), 104\u2013120 (2016)","journal-title":"Networks"},{"issue":"3","key":"17_CR12","first-page":"301","volume":"6","author":"A Radwan","year":"2001","unstructured":"Radwan, A.: A new algorithm for orthogonal drawings of 3-planar graphs. Int. J. Appl. Math. 6(3), 301\u2013317 (2001)","journal-title":"Int. J. Appl. Math."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-21527-8_21","volume-title":"Network Optimization","author":"L Simonetti","year":"2011","unstructured":"Simonetti, L., Salles da Cunha, A., Lucena, A.: The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 162\u2013169. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21527-8_21"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/LCOMM.2006.1603363","volume":"10","author":"MT Thai","year":"2006","unstructured":"Thai, M.T., Du, D.Z.: Connected dominating sets in disk graphs with bidirectional links. IEEE Commun. Lett. 10(3), 138\u2013140 (2006)","journal-title":"IEEE Commun. Lett."},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-319-26626-8_27","volume-title":"Combinatorial Optimization and Applications","author":"S Toubaline","year":"2015","unstructured":"Toubaline, S., Poirion, P.-L., D\u2019Ambrosio, C., Liberti, L.: Observing the state of a smart grid using bilevel programming. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 364\u2013376. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_27"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Yuill, W., Edwards, A., Chowdhury, S., Chowdhury, S.P.: Optimal PMU placement: a comprehensive literature review. In: 2011 IEEE Power and Energy Society General Meeting, pp. 1\u20138, July 2011","DOI":"10.1109\/PES.2011.6039376"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71150-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:46:17Z","timestamp":1709819177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71150-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711492","9783319711508"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71150-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"17 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}