{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T23:41:40Z","timestamp":1790379700268,"version":"4.1.0"},"reference-count":29,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>The NP-hard Subset Interconnection Design problem, also known as Minimum Topic-Connected Overlay, is motivated by numerous applications including the design of scalable overlay networks and vacuum systems. It has as input a finite set $V$ and a collection of subsets $V_1, V_2, \\ldots, V_m \\subseteq V$, and asks for a minimum-cardinality edge set $E$ such that for the graph $G=(V,E)$ all induced subgraphs $G[V_1], G[V_2], \\ldots, G[V_m]$ are connected. We study Subset Interconnection Design in the context of polynomial-time data reduction rules that preserve the possibility of constructing optimal solutions. Our contribution is threefold: First, we show the incorrectness of earlier polynomial-time data reduction rules. Second, we show linear-time solvability in case of a constant number $m$ of subsets, implying fixed-parameter tractability for the parameter $m$. Third, we provide a fixed-parameter tractability result for small subset sizes and tree-like output graphs. To achieve our results, we elaborate on polynomial-time data reduction rules which also may be of practical use in solving Subset Interconnection Design.<\/jats:p>","DOI":"10.1137\/140955057","type":"journal-article","created":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T12:26:18Z","timestamp":1420547178000},"page":"1-25","source":"Crossref","is-referenced-by-count":13,"title":["Polynomial-Time Data Reduction for the Subset Interconnection Design Problem"],"prefix":"10.1137","volume":"29","author":[{"given":"Jiehua","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,1,6]]},"reference":[{"key":"atypb1","first-page":"104","author":"Angluin D.","year":"2010","journal-title":"Berlin"},{"key":"atypb2","first-page":"201","author":"Brandes U.","year":"2011","journal-title":"Berlin"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.12.009"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00237"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1541"},{"key":"atypb6","first-page":"109","author":"Chockler G.","year":"2007","journal-title":"New York"},{"key":"atypb7","unstructured":"V. Conitzer, J. Derryberry, and T. Sandholm,\n                      Combinatorial auctions with structured item graphs\n                      , in 19th National Conference on Artificial Intelligence, AAAI Press\/The MIT Press, Menlo Park, CA, 2004, pp. 212-218."},{"key":"atypb8","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows,\n                      Fundamentals of Parameterized Complexity\n                      , Springer, London, 2013.","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(86)90010-7"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096768"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/0401042"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00023-1"},{"key":"atypb13","first-page":"51","author":"Fan H.","year":"2008","journal-title":"GA"},{"key":"atypb14","first-page":"201","author":"Fan H.","year":"2008","journal-title":"Berlin"},{"key":"atypb15","unstructured":"J. Flum and M. Grohe,\n                      Parameterized Complexity Theory\n                      , Springer, Berlin, 2006."},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1145\/1233481.1233493"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054199000125"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.12.033"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190110306"},{"key":"atypb20","first-page":"396","author":"Kaufmann M.","year":"2009","journal-title":"Berlin"},{"key":"atypb21","first-page":"265","author":"Klemz B.","year":"2014","journal-title":"Berlin"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0410-x"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.11.051"},{"key":"atypb24","doi-asserted-by":"crossref","unstructured":"H. Liu, V. Ramasubramanian, and E. G. Sirer,\n                      Client behavior and feed characteristics of RSS, a publish-subscribe system for web micronews\n                      , in Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement USENIX Association, Berkeley, CA, 2005, pp. 29-34.","DOI":"10.1145\/1330107.1330111"},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"R. Niedermeier,\n                      Invitation to Fixed-Parameter Algorithms\n                      , Oxford University Press, Oxford, 2006.","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2144999"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"atypb28","unstructured":"T.Z. Tang,\n                      A criterion for a minimum feasible graph\n                      , Math. Appl. (1989), pp. 21-24."},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1007\/BF02662501"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140955057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:36:24Z","timestamp":1787319384000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140955057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/140955057"],"URL":"https:\/\/doi.org\/10.1137\/140955057","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}