{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:18:57Z","timestamp":1759666737438,"version":"3.41.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T00:00:00Z","timestamp":1504483200000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s12532-017-0123-4","type":"journal-article","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T10:38:20Z","timestamp":1504521500000},"page":"69-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["A robust and scalable algorithm for the Steiner problem in graphs"],"prefix":"10.1007","volume":"10","author":[{"given":"Thomas","family":"Pajor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,4]]},"reference":[{"issue":"1","key":"123_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"123_CR2","doi-asserted-by":"crossref","unstructured":"Althaus, E., Blumenstock, M.: Algorithms for the maximum weight connected subgraph and prize-collecting Steiner tree problems. In: Manuscript Presented at the 11th DIMACS\/ICERM Implementation Challenge (2014)","DOI":"10.1007\/978-3-319-12691-3_21"},{"key":"123_CR3","first-page":"39","volume-title":"Essays and Surveys in Metaheuristics","author":"MP Bastos","year":"2001","unstructured":"Bastos, M.P., Ribeiro, C.C.: Reactive tabu search with path-relinking for the Steiner problem in graphs. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 39\u201358. Kluwer, Alphen aan den Rijn (2001)"},{"key":"123_CR4","doi-asserted-by":"crossref","unstructured":"Beasley, J.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069\u20131072 (1990). http:\/\/mscmga.ms.ic.ac.uk\/info.html","DOI":"10.1057\/jors.1990.166"},{"issue":"6","key":"123_CR5","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.orl.2013.08.007","volume":"41","author":"T Berthold","year":"2013","unstructured":"Berthold, T.: Measuring the impact of primal heuristics. Oper. Res. Lett. 41(6), 611\u2013614 (2013)","journal-title":"Oper. Res. Lett."},{"key":"123_CR6","doi-asserted-by":"crossref","unstructured":"Biazzo, I., Braunstein, A., Zecchina, R.: Performance of a cavity-method-based algorithm for the prize-collecting Steiner tree problem on graphs. Phys. Rev. E 86 (2012). http:\/\/arxiv.org\/abs\/1309.0346","DOI":"10.1103\/PhysRevE.86.026706"},{"key":"123_CR7","unstructured":"Biazzo, I., Muntoni, A., Braunstein, A., Zecchina, R.: On the performance of a cavity method based algorithm for the prize-collecting Steiner tree problem on graphs. In: Presentation at the 11th DIMACS\/ICERM Implementation Challenge (2014)"},{"issue":"1","key":"123_CR8","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/2432622.2432628","volume":"60","author":"J Byrka","year":"2013","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6:1\u20136:33 (2013)","journal-title":"J. ACM"},{"key":"123_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0255-1","volume-title":"Steiner Trees in Industry","author":"X Cheng","year":"2002","unstructured":"Cheng, X., Du, D.Z.: Steiner Trees in Industry. Springer, Berlin (2002)"},{"key":"123_CR10","doi-asserted-by":"crossref","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of the Steiner tree problem on graphs. In: Proceedings of 8th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS, vol. 2368, pp. 95\u201399. Springer (2002)","DOI":"10.1007\/3-540-45471-3_18"},{"key":"123_CR11","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1287\/ijoc.4.3.320","volume":"4","author":"S Chopra","year":"1992","unstructured":"Chopra, S., Gorres, E.R., Rao, M.R.: Solving the Steiner tree problem on a graph using branch and cut. ORSA J. Comput. 4, 320\u2013335 (1992)","journal-title":"ORSA J. Comput."},{"key":"123_CR12","unstructured":"Daneshmand, S.V.: Algorithmic approaches to the Steiner problem in networks. Ph.D. thesis, Universit\u00e4t Mannheim. http:\/\/d-nb.info\/970511787\/34 (2003)"},{"key":"123_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"123_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/03052159108941063","volume":"17","author":"K Dowsland","year":"1991","unstructured":"Dowsland, K.: Hill-climbing, simulated annealing and the Steiner problem in graphs. Eng. Optim. 17, 91\u2013107 (1991)","journal-title":"Eng. Optim."},{"key":"123_CR15","unstructured":"Duin, C.: Steiner\u2019s problem in graphs: approximation, reduction, variation. Ph.D. thesis, Institute for Actuarial Science and Economics, University of Amsterdam (1993)"},{"key":"123_CR16","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1002\/net.3230190506","volume":"19","author":"C Duin","year":"1989","unstructured":"Duin, C., Volgenant, A.: Reduction tests for the Steiner problem in graphs. Networks 19, 549\u2013567 (1989)","journal-title":"Networks"},{"key":"123_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7","volume":"29","author":"C Duin","year":"1997","unstructured":"Duin, C., Vo\u00df, S.: Efficient path and vertex exchange in Steiner tree algorithms. Networks 29, 89\u2013105 (1997)","journal-title":"Networks"},{"key":"123_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C Duin","year":"1999","unstructured":"Duin, C., Vo\u00df, S.: The Pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34, 181\u2013191 (1999)","journal-title":"Networks"},{"key":"123_CR19","unstructured":"Fischetti, M., Leitner, M., Ljubic, I., Luipersbeck, M., Monaci, M., Resch, M., Salvagnin, D., Sinnl, M.: Thinning out Steiner trees: a node-based model for uniform edge costs. In: Manuscript Presented at the 11th DIMACS\/ICERM Implementation Challenge (2014)"},{"issue":"2","key":"123_CR20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-016-0111-0","volume":"9","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Leitner, M., Ljubi\u0107, I., Luipersbeck, M., Monaci, M., Resch, M., Salvagnin, D., Sinnl, M.: Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2), 203\u2013229 (2017)","journal-title":"Math. Program. Comput."},{"key":"123_CR21","unstructured":"Frey, C.: Heuristiken und genetisch algorithmen f\u00fcr modifizierte Steinerbaumprobleme. Ph.D. thesis (1997)"},{"key":"123_CR22","unstructured":"Gamrath, G., Koch, T., Maher, S.J., Rehfeldt, D., Shinano, Y.: SCIP-Jack: a solver for STP and variants with parallelization extensions. In: Manuscript Presented at the 11th DIMACS\/ICERM Implementation Challenge (2014)"},{"key":"123_CR23","doi-asserted-by":"crossref","unstructured":"Gamrath, G., Koch, T., Maher, S.J., Rehfeldt, D., Shinano, Y.: SCIP-Jack\u2013a solver for STP and variants with parallelization extensions. Math. Program. Comput. 9(2), 231\u2013296 (2017)","DOI":"10.1007\/s12532-016-0114-x"},{"key":"123_CR24","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Olver, N., Rothvo\u00df, T., Zenklusen, R.: Matroids and integrality gaps for hypergraphic Steiner tree relaxations. In: ACM Symposium on Theory of Computing (STOC), pp. 1161\u20131176. ACM (2012)","DOI":"10.1145\/2213977.2214081"},{"key":"123_CR25","unstructured":"Hougardy, S., Silvanus, J., Vygen, J.: Dijkstra meets Steiner: A fast exact goal-oriented Steiner tree algorithm. Technical Report abs\/1406.0492, CoRR (2014)"},{"issue":"2","key":"123_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s12532-016-0110-1","volume":"9","author":"S Hougardy","year":"2017","unstructured":"Hougardy, S., Silvanus, J., Vygen, J.: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. Math. Program. Comput. 9(2), 135\u2013202 (2017)","journal-title":"Math. Program. Comput."},{"key":"123_CR27","doi-asserted-by":"crossref","unstructured":"Huang, T., Young, E.F.Y.: ObSteiner: an exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 882\u2013893","DOI":"10.1109\/TCAD.2013.2238291"},{"key":"123_CR28","unstructured":"Johnson, D.S., Koch, T., Werneck, R.F., Zachariasen, M.: 11th DIMACS Implementation Challenge in Collaboration with ICERM: Steiner Tree Problems. http:\/\/dimacs11.zib.de"},{"key":"123_CR29","unstructured":"Juhl, D., Warme, D.M., Winter, P., Zachariasen, M.: The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study. In: Manuscript Presented at the 11th DIMACS\/ICERM Implementation Challenge (2014)"},{"key":"123_CR30","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"123_CR31","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T Koch","year":"1998","unstructured":"Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32, 207\u2013232 (1998)","journal-title":"Networks"},{"key":"123_CR32","doi-asserted-by":"crossref","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: an updated library on Steiner tree problems in graphs. Tech. Rep. ZIB-Report 00-37, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin. http:\/\/elib.zib.de\/steinlib (2000)","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"123_CR33","unstructured":"Leitner, M., Ljubic, I., Luipersbeck, M., Prossegger, M., Resch, M.: New real-world instances for the Steiner tree problem in graphs. Tech. rep., ISOR, Uni Wien. http:\/\/homepage.univie.ac.at\/ivana.ljubic\/research\/STP\/realworld-stp-report-short.pdf (2014)"},{"key":"123_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K Mehlhorn","year":"1988","unstructured":"Mehlhorn, K.: A faster approximation algorithm for the Steiner problem in graphs. Inf. Process. Lett. 27, 125\u2013128 (1988)","journal-title":"Inf. Process. Lett."},{"key":"123_CR35","first-page":"221","volume":"28","author":"M Minoux","year":"1990","unstructured":"Minoux, M.: Efficient greedy heuristics for Steiner tree problems using reoptimization and supermodularity. INFOR 28, 221\u2013233 (1990)","journal-title":"INFOR"},{"issue":"3","key":"123_CR36","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1287\/ijoc.3.3.213","volume":"3","author":"L Osborne","year":"1991","unstructured":"Osborne, L., Gillett, B.: A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA J. Comp. 3(3), 213\u2013225 (1991)","journal-title":"ORSA J. Comp."},{"key":"123_CR37","unstructured":"Poggi de Arag\u00e3o, M., Ribeiro, C.C., Uchoa, E., Werneck, R.F.: Hybrid local search for the Steiner problem in graphs. In: Ext. Abstracts of the 4th Metaheuristics International Conference, pp. 429\u2013433. Porto (2001)"},{"key":"123_CR38","doi-asserted-by":"crossref","unstructured":"Poggi de Arag\u00e3o, M., Uchoa, E., Werneck, R.F.: Dual heuristics on the exact solution of large Steiner problems. In: Proceedings of Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO), Elec. Notes in Disc. Math. vol.\u00a07 (2001)","DOI":"10.1016\/S1571-0653(04)00247-1"},{"key":"123_CR39","doi-asserted-by":"crossref","unstructured":"Poggi de Arag\u00e3o, M., Werneck, R.F.: On the implementation of MST-based heuristics for the Steiner problem in graphs. In: Mount, D.M., Stein, C., (eds.) Proceedings of 4th Workshop on Algorithm Engineering and Experiments (ALENEX), LNCS, vol. 2409, pp. 1\u201315. Springer (2002)","DOI":"10.1007\/3-540-45643-0_1"},{"key":"123_CR40","unstructured":"Polzin, T.: Algorithms for the Steiner problem in networks. Ph.D. thesis, Universit\u00e4t des Saarlandes (2003)"},{"issue":"1\u20133","key":"123_CR41","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(00)00319-X","volume":"112","author":"T Polzin","year":"2001","unstructured":"Polzin, T., Vahdati Daneshmand, S.: Improved algorithms for the Steiner problem in networks. Discrete Appl. Math. 112(1\u20133), 263\u2013300 (2001)","journal-title":"Discrete Appl. Math."},{"key":"123_CR42","unstructured":"Polzin, T., Vahdati Daneshmand, S.: The Steiner tree challenge: an updated study. In: Manuscript Contributed to the 11th DIMACS\/ICERM Implementation Challenge. http:\/\/dimacs11.zib.de\/downloads.html (2014)"},{"issue":"1","key":"123_CR43","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"MGC Resende","year":"2004","unstructured":"Resende, M.G.C., Werneck, R.F.: A hybrid heuristic for the $$p$$ p -median problem. J. Heuristics 10(1), 59\u201388 (2004)","journal-title":"J. Heuristics"},{"key":"123_CR44","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1002\/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U","volume":"36","author":"CC Ribeiro","year":"2000","unstructured":"Ribeiro, C.C., Souza, M.C.: Tabu search for the Steiner problem in graphs. Networks 36, 138\u2013146 (2000)","journal-title":"Networks"},{"issue":"3","key":"123_CR45","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. Informs J. Comput. 14(3), 228\u2013246 (2002)","journal-title":"Informs J. Comput."},{"issue":"1","key":"123_CR46","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/S0895480101393155","volume":"19","author":"G Robins","year":"2005","unstructured":"Robins, G., Zelikovsky, A.: Tighter bounds for graph Steiner tree approximation. SIAM J. Discrete Math. 19(1), 122\u2013134 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"123_CR47","unstructured":"Rosseti, I., Poggi de Arag\u00e3o, M., Ribeiro, C.C., Uchoa, E., Werneck, R.F.: New benchmark instances for the Steiner problem in graphs. In: Ext. Abstracts of the 4th Metaheuristics International Conference, pp. 557\u2013591. Porto (2001)"},{"issue":"3","key":"123_CR48","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0204032","volume":"4","author":"PM Spira","year":"1975","unstructured":"Spira, P.M., Pan, A.: On finding and updating spanning trees and shortest paths. SIAM J. Comput. 4(3), 375\u2013380 (1975)","journal-title":"SIAM J. Comput."},{"key":"123_CR49","first-page":"573","volume":"24","author":"H Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japonica 24, 573\u2013577 (1980)","journal-title":"Math. Japonica"},{"key":"123_CR50","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"RE Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms. SIAM, Philadelphia (1983)"},{"issue":"1","key":"123_CR51","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1002\/net.10035","volume":"40","author":"E Uchoa","year":"2002","unstructured":"Uchoa, E., Poggi de Arag\u00e3o, M., Ribeiro, C.C.: Preprocessing Steiner problems from VLSI layout. Networks 40(1), 38\u201350 (2002)","journal-title":"Networks"},{"issue":"2","key":"123_CR52","first-page":"2.2:1","volume":"17","author":"E Uchoa","year":"2012","unstructured":"Uchoa, E., Werneck, R.F.: Fast local search for the Steiner problem in graphs. ACM J. Exper. Algorithms 17(2), 2.2:1\u20132.2:22 (2012)","journal-title":"ACM J. Exper. Algorithms"},{"key":"123_CR53","volume-title":"Modern Heuristic Search Methods","author":"MGA Verhoeven","year":"1996","unstructured":"Verhoeven, M.G.A., Severens, M.E.M., Aarts, E.H.L.: Local search for Steiner trees in graphs. In: Rayward-Smith, V.J., Osman, I.H., Reeves, C.R. (eds.) Modern Heuristic Search Methods. Wiley, New York (1996)"},{"issue":"1","key":"123_CR54","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0166-218X(92)90021-2","volume":"40","author":"S Vo\u00df","year":"1992","unstructured":"Vo\u00df, S.: Steiner\u2019s problem in graphs: heuristic methods. Discrete Appl. Math. 40(1), 45\u201372 (1992)","journal-title":"Discrete Appl. Math."},{"key":"123_CR55","volume-title":"Advances in Steiner Trees, Combinatorial Optimization","author":"D Warme","year":"2000","unstructured":"Warme, D., Winter, P., Zachariasen, M.: Exact algorithms for plane Steiner tree problems: a computational study. In: Du, D., Smith, J., Rubinstein, J. (eds.) Advances in Steiner Trees, Combinatorial Optimization, vol. 6. Kluwer, Alphen aan den Rijn (2000)"},{"key":"123_CR56","unstructured":"Werneck, R.F.: Steiner problem in graphs: primal, dual, and exact algorithms (In Portuguese). Master\u2019s thesis, Catholic University of Rio de Janeiro (2001)"},{"key":"123_CR57","first-page":"601","volume-title":"Metaheuristics: Computer Decision-Making","author":"RF Werneck","year":"2003","unstructured":"Werneck, R.F., Rosseti, I., de Aragao, M.P., Ribeiro, C.C., Uchoa, E.: New benchmark instances for the Steiner problem in graphs. In: Resende, M.G.C., Souza, J. (eds.) Metaheuristics: Computer Decision-Making, pp. 601\u2013614. Kluwer, Alphen aan den Rijn (2003)"},{"key":"123_CR58","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R Wong","year":"1984","unstructured":"Wong, R.: A dual ascent approach for Steiner tree problems on a directed graph. Math. Program. 28, 271\u2013287 (1984)","journal-title":"Math. Program."},{"key":"123_CR59","unstructured":"Zachariasen, M., Rohe, A.: Rectilinear group Steiner trees and applications in VLSI design. Tech. Rep. 00906, Institute for Discrete Mathematics, University of Bonn (2000)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-017-0123-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-017-0123-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-017-0123-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T15:01:44Z","timestamp":1750863704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-017-0123-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,4]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["123"],"URL":"https:\/\/doi.org\/10.1007\/s12532-017-0123-4","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"type":"print","value":"1867-2949"},{"type":"electronic","value":"1867-2957"}],"subject":[],"published":{"date-parts":[[2017,9,4]]}}}