{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:07Z","timestamp":1740109267475,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T00:00:00Z","timestamp":1527552000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Alexander von Humboldt-Foundation"},{"name":"Exellence Initiative of the German Federal and State Governments"},{"name":"Graduate School CE TU Darmstadt"},{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["KR 4286\/1","NI 369\/12"],"award-info":[{"award-number":["KR 4286\/1","NI 369\/12"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["551145\/14"],"award-info":[{"award-number":["551145\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]},{"name":"People Programme (Marie Curie Actions) of the European Unions Seventh Framework Programme","award":["FP7\/2007-2013"],"award-info":[{"award-number":["FP7\/2007-2013"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s00453-018-0460-3","type":"journal-article","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T09:34:52Z","timestamp":1527586492000},"page":"1126-1151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Minimum Feasible Tileset Problem"],"prefix":"10.1007","volume":"81","author":[{"given":"Yann","family":"Disser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,29]]},"reference":[{"issue":"4","key":"460_CR1","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1137\/080736831","volume":"39","author":"N Bansal","year":"2009","unstructured":"Bansal, N., Caprara, A., Sviridenko, M.: A new approximation method for set covering problems, with applications to multidimensional bin packing. SIAM J. Comput. 39(4), 1256\u20131278 (2009)","journal-title":"SIAM J. Comput."},{"key":"460_CR2","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-33971-4_4","volume-title":"In: Redundancy in Robot Manipulators and Multi-Robot Systems","author":"N Bezzo","year":"2013","unstructured":"Bezzo, N., Cortez, R.A., Fierro, R.: Exploiting heterogeneity in robotic networks. In: Redundancy in Robot Manipulators and Multi-Robot Systems. Lecture Notes in Electrical Engineering, vol. 57, pp. 53\u201375. Springer, Berlin, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-33971-4_4"},{"issue":"1","key":"460_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2004.12.001","volume":"148","author":"T Biedl","year":"2005","unstructured":"Biedl, T., Chan, T., Ganjali, Y., Hajiaghayi, M., Wood, D.: Balanced vertex-orderings of graphs. Discrete Appl. Math. 148(1), 27\u201348 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"460_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.7155\/jgaa.00237","volume":"15","author":"K Buchin","year":"2011","unstructured":"Buchin, K., van Kreveld, M.J., Meijer, H., Speckmann, B., Verbeek, K.: On planar supports for hypergraphs. J. Graph Algorithms Appl. 15(4), 533\u2013549 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"460_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/140955057","volume":"29","author":"J Chen","year":"2015","unstructured":"Chen, J., Komusiewicz, C., Niedermeier, R., Sorge, M., Such\u00fd, O., Weller, M.: Polynomial-time data reduction for the subset interconnection design problem. SIAM J. Discrete Math. 29(1), 1\u201325 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"460_CR6","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity (CCC)"},{"key":"460_CR7","doi-asserted-by":"crossref","unstructured":"Cygan., M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 509\u2013518 (2013)","DOI":"10.1109\/FOCS.2013.61"},{"key":"460_CR8","doi-asserted-by":"crossref","unstructured":"Dell, H., Marx, D.: Kernelization of packing problems. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 68\u201381 (2012)","DOI":"10.1137\/1.9781611973099.6"},{"issue":"4","key":"460_CR9","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/2629620","volume":"61","author":"H Dell","year":"2014","unstructured":"Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. J. ACM 61(4), 23:1\u201323:27 (2014)","journal-title":"J. ACM"},{"key":"460_CR10","doi-asserted-by":"crossref","unstructured":"Disser, Y., Kratsch, S., Sorge, M.: The minimum feasible tileset problem. In: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA \u201914), LNCS, vol. 8952, pp. 144\u2013155. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-319-18263-6_13"},{"issue":"2","key":"460_CR11","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/s10878-014-9786-1","volume":"31","author":"Y Disser","year":"2016","unstructured":"Disser, Y., Matuschke, J.: Degree-constrained orientations of embedded graphs. J. Comb. Optim. 31(2), 758\u2013773 (2016)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"460_CR12","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. 1(4), 416\u2013424 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"460_CR13","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"460_CR14","first-page":"353","volume":"18","author":"A Frank","year":"1976","unstructured":"Frank, A., Gy\u00e1rf\u00e1s, A.: How to orient the edges of a graph. Coll. Math. Soc. Janos Bolyai 18, 353\u2013364 (1976)","journal-title":"Coll. Math. Soc. Janos Bolyai"},{"issue":"1","key":"460_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"460_CR16","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H Freeman and Company, San Francisco (1979)"},{"issue":"4","key":"460_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/2508028.2505987","volume":"60","author":"G Gottlob","year":"2013","unstructured":"Gottlob, G., Greco, G.: Decomposing combinatorial auctions and set packing problems. J. ACM 60(4), 24 (2013)","journal-title":"J. ACM"},{"issue":"4","key":"460_CR18","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"S Hakimi","year":"1965","unstructured":"Hakimi, S.: On the degrees of the vertices of a directed graph. J. Frankl. Inst. 279(4), 290\u2013308 (1965)","journal-title":"J. Frankl. Inst."},{"issue":"3","key":"460_CR19","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"},{"issue":"1","key":"460_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf. Process. Lett. 37(1), 27\u201335 (1991)","journal-title":"Inf. Process. Lett."},{"key":"460_CR21","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12, 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"460_CR22","doi-asserted-by":"crossref","unstructured":"Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Proceedings of the 35th International Colloquium on Automata (ICALP), pp. 575\u2013586 (2008)","DOI":"10.1007\/978-3-540-70575-8_47"},{"key":"460_CR23","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"10","key":"460_CR24","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.robot.2008.06.006","volume":"56","author":"R Lundh","year":"2008","unstructured":"Lundh, R., Karlsson, L., Saffiotti, A.: Autonomous functional configuration of a network robot system. Robot. Auton. Syst. 56(10), 819\u2013830 (2008)","journal-title":"Robot. Auton. Syst."},{"key":"460_CR25","volume-title":"Parameterized Algorithms","author":"C Marek","year":"2015","unstructured":"Marek, C., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)"},{"issue":"3","key":"460_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2856125","volume":"48","author":"S Mittal","year":"2016","unstructured":"Mittal, S.: A survey of techniques for architecting and managing asymmetric multicore processors. ACM Comput. Surv. 48(3), 1\u201338 (2016)","journal-title":"ACM Comput. Surv."},{"key":"460_CR27","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"D Reinhard","year":"2016","unstructured":"Reinhard, D.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 5th edn. Springer, Berlin (2016)","edition":"5"},{"key":"460_CR28","series-title":"Texts in Computer Science","volume-title":"Fundamentals of Parameterized Complexity","author":"G Rodney","year":"2013","unstructured":"Rodney, G., Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Berlin (2013)"},{"key":"460_CR29","unstructured":"Schuurman, P., Woeginger, G.J.: Approximation schemes\u2014a tutorial. \n                    http:\/\/www.win.tue.nl\/~gwoegi\/papers\/ptas.pdf"},{"key":"460_CR30","doi-asserted-by":"crossref","unstructured":"Sviridenko, M., Ward, J.: Large neighborhood local search for the maximum set packing problem. In: 40th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 792\u2013803 (2013)","DOI":"10.1007\/978-3-642-39206-1_67"},{"key":"460_CR31","doi-asserted-by":"crossref","unstructured":"van Bevern, R., Kanj, I., Komusiewicz, C., Niedermeier, R., Sorge,M.: Twins in subdivision drawings of hypergraphs. In: Proceedings of the 24th International Symposium on Graph Drawing & Network Visualization, LNCS, vol. 9801, pp. 67\u201380. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-319-50106-2_6"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0460-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0460-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0460-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T20:34:22Z","timestamp":1559075662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0460-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,29]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["460"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0460-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,5,29]]},"assertion":[{"value":"3 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}