{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:28:22Z","timestamp":1742912902056,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319788241"},{"type":"electronic","value":"9783319788258"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-78825-8_10","type":"book-chapter","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T18:59:07Z","timestamp":1523905147000},"page":"116-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity Dichotomies for the Minimum $$\\mathcal {F}$$-Overlay Problem"],"prefix":"10.1007","author":[{"given":"Nathann","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorian","family":"Mazauric","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignasi","family":"Sau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Watrigant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,17]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1074\/mcp.M114.047779","volume":"14","author":"D Agarwal","year":"2015","unstructured":"Agarwal, D., Caillouet, C., Coudert, D., Cazals, F.: Unveiling contacts within macro-molecular assemblies by solving minimum weight connectivity inference problems. Mol. Cell. Proteomics 14, 2274\u20132284 (2015)","journal-title":"Mol. Cell. Proteomics"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-16108-7_12","volume-title":"Algorithmic Learning Theory","author":"D Angluin","year":"2010","unstructured":"Angluin, D., Aspnes, J., Reyzin, L.: Inferring social networks from outbreaks. In: Hutter, M., Stephan, F., Vovk, V., Zeugmann, T. (eds.) ALT 2010. LNCS (LNAI), vol. 6331, pp. 104\u2013118. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16108-7_12"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-19222-7_21","volume-title":"Combinatorial Algorithms","author":"U Brandes","year":"2011","unstructured":"Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Blocks of hypergraphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 201\u2013211. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19222-7_21"},{"key":"10_CR4","first-page":"505","volume":"2016","author":"Y Chen","year":"2016","unstructured":"Chen, Y., Lin, B.: The constant inapproximability of the parameterized dominating set problem. FOCS 2016, 505\u2013514 (2016)","journal-title":"FOCS"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chockler, G., Melamed, R., Tock, Y., Vitenberg, R.: Constructing scalable overlays for pub-sub with many topics. In: PODC 2007, pp. 109\u2013118. ACM (2007)","DOI":"10.1145\/1281100.1281118"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, N., Mazauric, D., Sau, I., Watrigant, R.: Complexity dichotomies for the minimum F-overlay problem. CoRR, abs\/1703.05156 (2017)","DOI":"10.1007\/978-3-319-78825-8_10"},{"key":"10_CR7","unstructured":"Conitzer, V., Derryberry, J., Sandholm, T.: Combinatorial auctions with structured item graphs. In: AAAI 2004, pp. 212\u2013218 (2004)"},{"key":"10_CR8","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"key":"10_CR9","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01096768","volume":"6","author":"DZ Du","year":"1995","unstructured":"Du, D.Z., Kelly, D.F.: On complexity of subset interconnection designs. J. Global Optim. 6(2), 193\u2013205 (1995)","journal-title":"J. Global Optim."},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0401042","volume":"1","author":"D Ding-Zhu","year":"1988","unstructured":"Ding-Zhu, D., Miller, Z.: Matroids and subset interconnection design. SIAM J. Discrete Math. 1(4), 416\u2013424 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-85097-7_19","volume-title":"Combinatorial Optimization and Applications","author":"H Fan","year":"2008","unstructured":"Fan, H., Hundt, C., Wu, Y.-L., Ernst, J.: Algorithms and implementation for interconnection graph problem. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 201\u2013210. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85097-7_19"},{"key":"10_CR13","unstructured":"Fan, H., Wu, Y.-L.: Interconnection graph problem. In: FCS 2008, pp. 51\u201355 (2008)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.tcs.2011.12.033","volume":"429","author":"J Hosoda","year":"2012","unstructured":"Hosoda, J., Hromkovic, J., Izumi, T., Ono, H., Steinov, M., Wada, K.: On the approximability and hardness of minimum topic connected overlay and its special instances. Theoret. Comput. Sci. 429, 144\u2013154 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190110306","volume":"11","author":"DS Johnson","year":"1987","unstructured":"Johnson, D.S., Pollak, H.O.: Hypergraph planarity and the complexity of drawing Venn diagrams. J. Graph Theory 11(3), 309\u2013325 (1987)","journal-title":"J. Graph Theory"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-08404-6_23","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"B Klemz","year":"2014","unstructured":"Klemz, B., Mchedlidze, T., N\u00f6llenburg, M.: Minimum tree supports for hypergraphs and low-concurrency Euler diagrams. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 265\u2013276. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_23"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10107-003-0410-x","volume":"98","author":"E Korach","year":"2003","unstructured":"Korach, E., Stern, M.: The clustering matroid and the optimal clustering tree. Math. Program. 98(1), 385\u2013414 (2003)","journal-title":"Math. Program."},{"issue":"5","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1109\/TNET.2011.2144999","volume":"19","author":"M Onus","year":"2011","unstructured":"Onus, M., Richa, A.W.: Minimum maximum-degree publish-subscribe overlay network design. IEEE\/ACM Trans. Netw. 19(5), 1331\u20131343 (2011)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78825-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:07:51Z","timestamp":1709809671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78825-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319788241","9783319788258"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78825-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Newcastle","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"17 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/carma.newcastle.edu.au\/meetings\/iwoca\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}