{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:29Z","timestamp":1770994049538,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T00:00:00Z","timestamp":1630713600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T00:00:00Z","timestamp":1630713600000},"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":["Algorithmica"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s00453-021-00868-x","type":"journal-article","created":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T05:02:59Z","timestamp":1630731779000},"page":"3681-3714","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem"],"prefix":"10.1007","volume":"83","author":[{"given":"Yuya","family":"Masumura","sequence":"first","affiliation":[]},{"given":"Taihei","family":"Oki","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1919-7195","authenticated-orcid":false,"given":"Yutaro","family":"Yamaguchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,4]]},"reference":[{"issue":"3","key":"868_CR1","first-page":"429","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. Part I: discharging. Ill. J. Math. 21(3), 429\u2013490 (1977)","journal-title":"Ill. J. Math."},{"issue":"3","key":"868_CR2","first-page":"491","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. Part II: reducibility. Ill. J. Math. 21(3), 491\u2013567 (1977)","journal-title":"Ill. J. Math."},{"issue":"1\u20132","key":"868_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10107-003-0438-y","volume":"97","author":"S Arora","year":"2003","unstructured":"Arora, S.: Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Program. 97(1\u20132), 43\u201369 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"868_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37(2), 194\u2013197 (1941)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"1","key":"868_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2007.10.013","volume":"390","author":"V Chepoi","year":"2008","unstructured":"Chepoi, V., Nouioua, K., Vax\u00e8s, Y.: A rounding algorithm for approximating minimum Manhattan networks. Theoret. Comput. Sci. 390(1), 56\u201369 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"868_CR6","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s00454-011-9342-z","volume":"45","author":"FY Chin","year":"2011","unstructured":"Chin, F.Y., Guo, Z., Sun, H.: Minimum Manhattan network is NP-complete. Discrete Comput. Geom. 45(4), 701\u2013722 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"868_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, New York (2015)"},{"issue":"4","key":"868_CR8","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1007\/s00453-017-0298-0","volume":"80","author":"A Das","year":"2018","unstructured":"Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the generalized minimum Manhattan network problem. Algorithmica 80(4), 1170\u20131190 (2018)","journal-title":"Algorithmica"},{"key":"868_CR9","unstructured":"Funke, S., Seybold, M.P.: The generalized minimum Manhattan network problem (GMMN)-scale-diversity aware approximation and a primal\u2013dual algorithm. In: Proceedings of Canadian Conference on Computational Geometry (CCCG), vol. 26 (2014)"},{"issue":"2","key":"868_CR10","first-page":"219","volume":"8","author":"J Gudmundsson","year":"2001","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Approximating a minimum Manhattan network. Nordic J. Comput. 8(2), 219\u2013232 (2001)","journal-title":"Nordic J. Comput."},{"key":"868_CR11","doi-asserted-by":"crossref","unstructured":"Guo, Z., Sun, H., Zhu, H.: Greedy construction of 2-approximation minimum Manhattan network. In: Proceedings of International Symposium on Algorithms and Computation (ISAAC), 4\u201315 (2008)","DOI":"10.1007\/978-3-540-92182-0_4"},{"issue":"3","key":"868_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1023\/A:1009826311973","volume":"4","author":"B Lu","year":"2000","unstructured":"Lu, B., Ruan, L.: Polynomial time approximation scheme for the rectilinear Steiner arborescence problem. J. Comb. Optim. 4(3), 357\u2013363 (2000)","journal-title":"J. Comb. Optim."},{"key":"868_CR13","doi-asserted-by":"crossref","unstructured":"Masumura, Y., Oki, T., Yamaguchi, Y.: Dynamic programming approach to the generalized minimum Manhattan network problem. In: Proceedings of International Symposium on Combinatorial Optimization (ISCO), 237\u2013248 (2020)","DOI":"10.1007\/978-3-030-53262-8_20"},{"issue":"1","key":"868_CR14","first-page":"59","volume":"18","author":"L Nastansky","year":"1974","unstructured":"Nastansky, L., Selkow, S.M., Stewart, N.F.: Cost-minimal trees in directed acyclic graphs. Z. Oper. Res. 18(1), 59\u201367 (1974)","journal-title":"Z. Oper. Res."},{"key":"868_CR15","unstructured":"Nouioua, K.: Enveloppes de Pareto et R\u00e9seaux de Manhattan: Caract\u00e9risations et Algorithmes. Ph.D. thesis, Universit\u00e9 de la M\u00e9diterran\u00e9e (2005)"},{"issue":"1\u20136","key":"868_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01758762","volume":"7","author":"SK Rao","year":"1992","unstructured":"Rao, S.K., Sadayappan, P., Hwang, F.K., Shor, P.W.: The rectilinear Steiner arborescence problem. Algorithmica 7(1\u20136), 277\u2013288 (1992)","journal-title":"Algorithmica"},{"issue":"1","key":"868_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. J. Comb. Theory Ser. B 70(1), 2\u201344 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"868_CR18","unstructured":"Schnizler, M.: The generalized minimum manhattan network problem. Master\u2019s thesis, University of Stuttgart (2015)"},{"key":"868_CR19","unstructured":"Seybold, M.P.: Algorithm engineering in geometric network planning and data mining. Ph.D. thesis, University of Stuttgart (2018)"},{"issue":"3","key":"868_CR20","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1137\/S0097539704371353","volume":"35","author":"W Shi","year":"2005","unstructured":"Shi, W., Su, C.: The rectilinear Steiner arborescence problem is NP-complete. SIAM J. Comput. 35(3), 729\u2013740 (2005)","journal-title":"SIAM J. Comput."},{"key":"868_CR21","doi-asserted-by":"crossref","unstructured":"Zachariasen, M.: On the approximation of the rectilinear Steiner arborescence problem in the plane. (Unpublished Manuscript) (2000)","DOI":"10.1007\/978-1-4613-0255-1_16"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00868-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00868-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00868-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T11:38:27Z","timestamp":1637321907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00868-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,4]]},"references-count":21,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["868"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00868-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,4]]},"assertion":[{"value":"24 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}