{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:45:03Z","timestamp":1725763503844},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_34","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T21:32:52Z","timestamp":1386797572000},"page":"361-371","source":"Crossref","is-referenced-by-count":2,"title":["Effective and Efficient Data Reduction for the Subset Interconnection Design Problem"],"prefix":"10.1007","author":[{"given":"Jiehua","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","series-title":"LNAI","first-page":"104","volume-title":"ALT 2010","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.\u00a06331, pp. 104\u2013118. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Chockler, G., Melamed, R., Tock, Y., Vitenberg, R.: Constructing scalable overlays for pub-sub with many topics. In: Proc. 26th PODC, pp. 109\u2013118. ACM (2007)","key":"34_CR2","DOI":"10.1145\/1281100.1281118"},{"doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","key":"34_CR3","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0166-218X(86)90010-7","volume":"14","author":"D.-Z. Du","year":"1986","unstructured":"Du, D.-Z.: An optimization problem on graphs. Discrete Appl. Math.\u00a014(1), 101\u2013104 (1986)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"34_CR5","first-page":"193","volume":"6","author":"D.-Z. Du","year":"1995","unstructured":"Du, D.-Z., Kelley, D.F.: On complexity of subset interconnection designs. J.\u00a0Global\u00a0Optim.\u00a06(2), 193\u2013205 (1995)","journal-title":"J.\u00a0Global\u00a0Optim."},{"issue":"4","key":"34_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0401042","volume":"1","author":"D.-Z. Du","year":"1988","unstructured":"Du, D.-Z., Miller, Z.: Matroids and subset interconnection design. SIAM J. Discrete Math.\u00a01(4), 416\u2013424 (1988)","journal-title":"SIAM J. Discrete Math."},{"unstructured":"Fan, H., Wu, Y.-L.: Interconnection graph problem. In: Proc. FCS 2008, pp. 51\u201355. CSREA Press (2008)","key":"34_CR7"},{"key":"34_CR8","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.\u00a05165, pp. 201\u2013210. Springer, Heidelberg (2008)"},{"unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)","key":"34_CR9"},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"key":"34_CR11","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., Hromkovi\u010d, J., Izumi, T., Ono, H., Steinov\u00e1, M., Wada, K.: On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci.\u00a0429, 144\u2013154 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"34_CR12","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.\u00a098(1-3), 385\u2013414 (2003)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","key":"34_CR13","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"5","key":"34_CR14","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.\u00a019(5), 1331\u20131343 (2011)","journal-title":"IEEE\/ACM Trans. Netw."},{"unstructured":"Tang, T.-Z.: An optimality condition for minimum feasible graphs. Applied Mathematics - A Journal of Chinese Universities, 24\u201321 (1989) (in Chinese)","key":"34_CR15"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/BF02662501","volume":"10","author":"Y. Xu","year":"1995","unstructured":"Xu, Y., Fu, X.: On the minimum feasible graph for four sets. Applied Mathematics - A Journal of Chinese Universities\u00a010, 457\u2013462 (1995)","journal-title":"Applied Mathematics - A Journal of Chinese Universities"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T16:28:05Z","timestamp":1564936085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}