{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T15:49:48Z","timestamp":1748015388440,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_23","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"273-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams"],"prefix":"10.1007","author":[{"given":"Hirofumi","family":"Suzuki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masakazu","family":"Ishihata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/52.776952","volume":"16","author":"R Ellison","year":"1999","unstructured":"Ellison, R., Linger, R., Longstaff, T., Mead, N.: Survivable network system analysis: a case study. IEEE Software 16, 70\u201377 (1999)","journal-title":"IEEE Software"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H Kerivin","year":"2005","unstructured":"Kerivin, H., Mahjoub, A.R.: Design of survivable networks: a survey. Networks 46(1), 1\u201321 (2005)","journal-title":"Networks"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.cor.2010.05.003","volume":"38","author":"I Akg\u00fcn","year":"2011","unstructured":"Akg\u00fcn, I.: New formulations for the hop-constrained minimum spanning tree problem via sherali and driscoll\u2019s tightened miller-tucker-zemlin constraints. Comput. Oper. Res. 38(1), 277\u2013286 (2011)","journal-title":"Comput. Oper. Res."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1002\/net.21667","volume":"67","author":"I Diarrassouba","year":"2015","unstructured":"Diarrassouba, I., Gabrel, V., Ridha Mahjoub, A., Gouveia, L., Pesneau, P.: Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. Networks 67, 148\u2013169 (2015)","journal-title":"Networks"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Fortz, B.: Design of survivable networks with bounded rings. In: Network Theory and Applications (2000)","DOI":"10.1007\/978-1-4615-4669-6"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-009-0297-2","volume":"128","author":"L Gouveia","year":"2011","unstructured":"Gouveia, L., Simonetti, L., Uchoa, E.: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as steiner tree problems over layered graphs. Math. Program. 128(1), 123\u2013148 (2011)","journal-title":"Math. Program."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1002\/net.21687","volume":"68","author":"I Rodriguez-Martin","year":"2016","unstructured":"Rodriguez-Martin, I., Salazar Gonzlez, J.J., Yaman, H.: The ring\/$$\\kappa $$-rings network design problem: model and branch-and-cut algorithm. Networks 68, 130\u2013140 (2016)","journal-title":"Networks"},{"key":"23_CR8","unstructured":"Penttinen, A.: Chapter 10 - Network planning and dimensioning. Lecture Notes: S-38.145 - Introduction to Teletraffic Theory. Helsinki University of Technology (1999)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDS for set manipulation in combinatorial problems. In: DAC, pp. 272\u2013277 (1993)","DOI":"10.1145\/157485.164890"},{"key":"23_CR10","unstructured":"Knuth, D.E.: The Art of Computer Programming: Bitwise tricks & Techniques. Binary Decision Diagrams, vol. 4, fascicle 1. Addison-Wesley Professional, Boston (2009)"},{"issue":"9","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1587\/transfun.E100.A.1773","volume":"E100\u2013A","author":"J Kawahara","year":"2017","unstructured":"Kawahara, J., Inoue, T., Iwashita, H., Minato, S.: Frontier-based search for enumerating all constrained subgraphs with compressed representation. IEICE Trans. Fundam. E100\u2013A(9), 1773\u20131784 (2017)","journal-title":"IEICE Trans. Fundam."},{"key":"23_CR12","unstructured":"Coudert, O.: Solving graph optimization problems with ZBDDS. In: Proceedings of the 1997 European Conference on Design and Test, EDTC 1997, p. 224 (1997)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-53925-6_10","volume-title":"WALCOM: Algorithms and Computation","author":"Jun Kawahara","year":"2017","unstructured":"Kawahara, J., Horiyama, T., Hotta, K., Minato, S.I.: Generating all patterns of graph partitions within a disparity bound. In: WALCOM: Algorithms and Computation, pp. 119\u2013131 (2017)"},{"key":"23_CR14","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-319-48517-1_26","volume-title":"Computational Intelligence in Information Systems","author":"J Kawahara","year":"2017","unstructured":"Kawahara, J., Saitoh, T., Suzuki, H., Yoshinaka, R.: Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs. In: Phon-Amnuaisuk, S., Au, T.-W., Omar, S. (eds.) CIIS 2016. AISC, vol. 532, pp. 294\u2013305. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48517-1_26"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Minato, S., Ishiura, N., Yajima, S.: Shared binary decision diagram with attributed edges for efficient boolean function manipulation. In: 27th ACM\/IEEE Design Automation Conference, pp. 52\u201357 (1990)","DOI":"10.1145\/123186.123225"},{"key":"23_CR16","unstructured":"Amarilli, A., Bourhis, P., Jachiet, L., Mengel, S.: A circuit-based approach to efficient enumeration. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), vol. 80, pp. 111:1\u2013111:15 (2017)"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ipl.2012.05.007","volume":"112","author":"R Yoshinaka","year":"2012","unstructured":"Yoshinaka, R., Kawahara, J., Denzumi, S., Arimura, H., Ichi-Minato, S.: Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. Inf. Process. Lett. 112, 636\u2013640 (2012)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:06:02Z","timestamp":1582139162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}