{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:03:21Z","timestamp":1729627401615,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/drcn.2016.7470828","type":"proceedings-article","created":{"date-parts":[[2016,5,20]],"date-time":"2016-05-20T03:51:13Z","timestamp":1463716273000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["The k-node-connected subgraph problem: Facets and Branch-and-Cut"],"prefix":"10.1109","author":[{"given":"Ibrahima","family":"Diarrassouba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meriem","family":"Mahjoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Ridha","family":"Mahjoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1090\/dimacs\/005\/08","article-title":"Polyhedral Approaches to Network Survivability","volume":"5","author":"gr\u00f6tschel","year":"1991","journal-title":"Ser in Discrete Math and Theoretical Comput Sci"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0403043"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.2.309"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.6.1012"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/net.20072"},{"journal-title":"Heuristics for designing highly survivable sommunication networks","year":"1989","author":"ko","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00088-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582572"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00015-6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480191222665"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2013.05.137"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2003.11.007"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0576-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0654-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.05.001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20310"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref9"}],"event":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","start":{"date-parts":[[2016,3,15]]},"location":"Paris","end":{"date-parts":[[2016,3,17]]}},"container-title":["2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7467375\/7470820\/07470828.pdf?arnumber=7470828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T22:59:52Z","timestamp":1567897192000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7470828\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/drcn.2016.7470828","relation":{},"subject":[],"published":{"date-parts":[[2016,3]]}}}