{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:24:52Z","timestamp":1768980292259,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T00:00:00Z","timestamp":1611878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T00:00:00Z","timestamp":1611878400000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10878-020-00690-1","type":"journal-article","created":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T09:42:56Z","timestamp":1611913376000},"page":"1509-1533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Steiner trees under node and edge privacy conflicts"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4989-7587","authenticated-orcid":false,"given":"Alessandro","family":"Hill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0938-5798","authenticated-orcid":false,"given":"Roberto","family":"Baldacci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,29]]},"reference":[{"issue":"1","key":"690_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230190102","volume":"19","author":"JE Beasley","year":"1989","unstructured":"Beasley JE (1989) An SST-based algorithm for the Steiner problem in graphs. Networks 19(1):1\u201316","journal-title":"Networks"},{"issue":"9","key":"690_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577","journal-title":"Commun ACM"},{"issue":"3","key":"690_CR3","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 ER, Rao M (1992) Solving the Steiner tree problem on a graph using branch and cut. ORSA J Comput 4(3):320\u2013335","journal-title":"ORSA J Comput"},{"issue":"1\u20133","key":"690_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01582573","volume":"64","author":"S Chopra","year":"1994","unstructured":"Chopra S, Rao MR (1994) The Steiner tree problem I: formulations, compositions and extension of facets. Math Program 64(1\u20133):209\u2013229","journal-title":"Math Program"},{"key":"690_CR5","unstructured":"Cornet A, Laforest C (2017) Total domination, connected vertex cover and Steiner tree with conflicts. Discret Math Theor Comput Sci 19(3). http:\/\/dmtcs.episciences.org\/4154"},{"key":"690_CR6","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-319-42432-3_63","volume-title":"Mathematical software: ICMS 2016","author":"L Di Puglia Pugliese","year":"2016","unstructured":"Di Puglia Pugliese L, Gaudioso M, Guerriero F, Miglionico G (2016) An algorithm to find the link constrained Steiner tree in undirected graphs. In: Greuel GM, Koch T, Paule P, Sommese A (eds) Mathematical software: ICMS 2016. Springer International Publishing, Cham, pp 492\u2013497"},{"key":"690_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.21901","volume":"75","author":"B Filipecki","year":"2020","unstructured":"Filipecki B, Van Vyve M (2020) Stronger path-based extended formulation for the Steiner tree problem. Networks 75:3\u201317","journal-title":"Networks"},{"issue":"2","key":"690_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s12532-016-0114-x","volume":"9","author":"G Gamrath","year":"2017","unstructured":"Gamrath G, Koch T, Maher SJ, Rehfeldt D, Shinano Y (2017) SCIP-Jack: a solver for STP and variants with parallelization extensions. Math Program Comput 9(2):231\u2013296","journal-title":"Math Program Comput"},{"key":"690_CR9","doi-asserted-by":"crossref","unstructured":"Hill A, Baldacci R, Vo\u00df S (2019) Branch-and-cut algorithms for Steiner tree problems with privacy conflicts. In: Computing and combinatorics, Lecture notes in computer science, vol 11653, pp 266\u2013278. Springer International Publishing","DOI":"10.1007\/978-3-030-26176-4_22"},{"key":"690_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.cor.2018.02.004","volume":"94","author":"A Hill","year":"2018","unstructured":"Hill A, Schwarze S (2018) Exact algorithms for bi-objective ring tree problems with reliability measures. Comput Oper Res 94:38\u201351","journal-title":"Comput Oper Res"},{"key":"690_CR11","unstructured":"IBM CPLEX (2018) IBM ILOG CPLEX 12.90 callable library"},{"key":"690_CR12","unstructured":"Johnson DS, Minkoff M, Phillips S (2000) The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the eleventh annual ACM-SIAM symposium on discrete algorithms, pp 760\u2013769. Society for Industrial and Applied Mathematics"},{"key":"690_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-38236-9_31","volume-title":"Theory and applications of models of computation","author":"MM Kant\u00e9","year":"2013","unstructured":"Kant\u00e9 MM, Laforest C, Mom\u00e8ge B (2013) Trees in graphs with conflict edges or forbidden transitions. In: Chan THH, Lau LC, Trevisan L (eds) Theory and applications of models of computation. Springer, Berlin, pp 343\u2013354"},{"key":"690_CR14","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of computer computations, pp 85\u2013103. Springer","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"690_CR15","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 (1998) Solving Steiner tree problems in graphs to optimality. Networks 32(3):207\u2013232","journal-title":"Networks"},{"key":"690_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-1-4613-0255-1_9","volume-title":"Steiner trees in industry","author":"T Koch","year":"2001","unstructured":"Koch T, Martin A, Vo\u00df S (2001) Steinlib: an updated library on Steiner tree problems in graphs. In: Cheng XZ, Du DZ (eds) Steiner trees in industry. Springer, Boston, pp 285\u2013325"},{"key":"690_CR17","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.dam.2011.07.008","volume":"164","author":"V Leggieri","year":"2014","unstructured":"Leggieri V, Haouari M, Triki C (2014) The Steiner tree problem with delays: a compact formulation and reduction procedures. Discret Appl Math 164:178\u2013190","journal-title":"Discret Appl Math"},{"issue":"1","key":"690_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0166-218X(00)00318-8","volume":"112","author":"T Polzin","year":"2001","unstructured":"Polzin T, Daneshmand SV (2001) A comparison of Steiner tree relaxations. Discret Appl Math 112(1):241\u2013261","journal-title":"Discret Appl Math"},{"key":"690_CR19","doi-asserted-by":"crossref","unstructured":"Siebert M, Ahmed S, Nemhauser G (2018) A linear programming based approach to the Steiner tree problem with a fixed number of terminals. arXiv preprint arXiv:1812.02237","DOI":"10.1002\/net.21913"},{"key":"690_CR20","unstructured":"Una DD, Gange G, Schachte P, Stuckey PJ (2016) Steiner tree problems with side constraints using constraint programming. In: Proceedings of the thirtieth AAAI conference on Artificial Intelligence (AAAI-16), pp 3383\u20133389. Association for the Advancement of Artificial Intelligence"},{"issue":"6","key":"690_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1070\/RM1968v023n06ABEH001252","volume":"23","author":"VG Vizing","year":"1968","unstructured":"Vizing VG (1968) Some unsolved problems in graph theory. Russian Math Surv 23(6):125\u2013141","journal-title":"Russian Math Surv"},{"issue":"1","key":"690_CR22","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 (1992) Steiner\u2019s problem in graphs: heuristic methods. Discret Appl Math 40(1):45\u201372","journal-title":"Discret Appl Math"},{"key":"690_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1018967121276","volume":"86","author":"S Vo\u00df","year":"1999","unstructured":"Vo\u00df S (1999) The Steiner tree problem with hop constraints. Ann Oper Res 86:321\u2013345","journal-title":"Ann Oper Res"},{"issue":"3","key":"690_CR24","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"RT Wong","year":"1984","unstructured":"Wong RT (1984) A dual ascent approach for Steiner tree problems on a directed graph. Math Program 28(3):271\u2013287","journal-title":"Math Program"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00690-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00690-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00690-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T18:00:43Z","timestamp":1657735243000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00690-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,29]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["690"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00690-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,29]]},"assertion":[{"value":"28 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}