{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:12:49Z","timestamp":1743138769822,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031086229"},{"type":"electronic","value":"9783031086236"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08623-6_24","type":"book-chapter","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:06:24Z","timestamp":1661756784000},"page":"154-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Minimum Balanced Separators - An Exact Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1104-3383","authenticated-orcid":false,"given":"William","family":"Surau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7223-9174","authenticated-orcid":false,"given":"Ralf","family":"Bornd\u00f6rfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2901-5065","authenticated-orcid":false,"given":"Stephan","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300\u2013343 (1984)","DOI":"10.1016\/0022-0000(84)90071-0"},{"key":"24_CR2","unstructured":"Bornd\u00f6rfer, R., Schwartz, S., Surau, W.: Vertex Covering with Capacitated Trees. Eng. Tech. rep. 21\u201314. Takustr. 7, 14195 Berlin: ZIB (2021)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-62127-2_20","volume-title":"Algorithms and Data Structures","author":"S Brandt","year":"2017","unstructured":"Brandt, S., Wattenhofer, R.: Approximating small balanced vertex separators in almost linear time. In: WADS 2017. LNCS, vol. 10389, pp. 229\u2013240. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_20"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Nguyen Bui, T., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42(3) 153\u2013159 (1992)","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"24_CR5","unstructured":"Casel, K., Friedrich, T., Issac, D., Niklanovits, A., Zeif, Z.: Balanced crown decomposition for connectivity constraints. arXiv:2011.0452, arXiv.preprint (2020)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Clautiaux, F., Guillot, J., Pesneau, P.: Exact approaches for solving a covering problem with capacitated subtrees. Comput. Oper. Res. 105, 85\u2013101 (2019)","DOI":"10.1016\/j.cor.2019.01.008"},{"key":"24_CR7","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol. 5. 4. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"24_CR8","unstructured":"Ziena Elijazyfer. \u201cL\u00e4ngenbeschr\u00e4nkte Teilgraphenbildung zur Maut-Kontrollstreckenoptimierung\u201d. Masterthesis. Freie Universit\u00e4t Berlin, 2018"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U., Taghi Hajiaghayi, M., Lee, J.R.: Improved approximation algorithms for minimum weight vertex separators. SIAM J. Comput. 38(2), 629\u2013657 (2008)","DOI":"10.1137\/05064299X"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/11561071_56","volume-title":"Algorithms \u2013 ESA 2005","author":"M Holzer","year":"2005","unstructured":"Holzer, M., Prasinos, G., Schulz, F., Wagner, D., Zaroliagis, C.: Engineering planar separator algorithms. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 628\u2013639. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_56"},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Rosenberg, A.L., Heath, L.S.: Graph Separators, with Applications. Springer, NewYork (2001). https:\/\/doi.org\/10.1007\/b115747","DOI":"10.1007\/b115747"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Salazar-Aguilar, M., R\u00f3os-Mercado, R.Z., R\u00edos, M.C.: New models for commercial territory design. Netw. Spatial Econ. 11(3), 487\u2013507 (2011)","DOI":"10.1007\/s11067-010-9151-6"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"de Souza, C.C., Cavalcante, V.F.: Exact algorithms for the vertex separator problem in graphs. Networks 57(3) 212\u2013230 (2011)","DOI":"10.1002\/net.20420"},{"key":"24_CR14","volume-title":"Das homogene l\u00e4ngenbeschr\u00e4nkte zusammenh\u00e4ngende Teilgraphen\u00fcberdeckungsproblem","author":"W Surau","year":"2020","unstructured":"Surau, W.: Das homogene l\u00e4ngenbeschr\u00e4nkte zusammenh\u00e4ngende Teilgraphen\u00fcberdeckungsproblem. Freie Universit\u00e4t Berlin, Bachelorthesis (2020)"}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08623-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:08:22Z","timestamp":1661756902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08623-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031086229","9783031086236"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08623-6_24","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.or2021.unibe.ch\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}