{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T17:15:29Z","timestamp":1721236529709},"reference-count":17,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1016\/j.orl.2016.10.010","type":"journal-article","created":{"date-parts":[[2016,10,27]],"date-time":"2016-10-27T19:01:14Z","timestamp":1477594874000},"page":"835-838","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology"],"prefix":"10.1016","volume":"44","author":[{"given":"Annika Kristina","family":"Kiefner","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.orl.2016.10.010_br000005","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230070104","article-title":"Rectilinear Steiner trees: efficient special-case algorithms","volume":"7","author":"Aho","year":"1977","journal-title":"Networks"},{"key":"10.1016\/j.orl.2016.10.010_br000010","series-title":"Network Optimization (Gainesville, FL, 1996)","first-page":"221","article-title":"Two special cases for rectilinear Steiner minimum trees","volume":"vol. 450","author":"Du","year":"1997"},{"issue":"1","key":"10.1016\/j.orl.2016.10.010_br000015","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s004539910005","article-title":"On exact solutions for the rectilinear Steiner tree problem. I. Theoretical results","volume":"26","author":"F\u00f6\u00dfmeier","year":"2000","journal-title":"Algorithmica"},{"key":"10.1016\/j.orl.2016.10.010_br000020","series-title":"Algorithms and Computation (Hong Kong, 1993)","first-page":"533","article-title":"Faster approximation algorithms for the rectilinear Steiner tree problem","volume":"vol. 762","author":"F\u00f6\u00dfmeier","year":"1993"},{"issue":"4","key":"10.1016\/j.orl.2016.10.010_br000025","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.orl.2016.10.010_br000030","series-title":"Integer Programming and Combinatorial Optimization","first-page":"229","article-title":"Shallow-light Steiner arborescences with vertex delays","volume":"vol. 7801","author":"Held","year":"2013"},{"key":"10.1016\/j.orl.2016.10.010_br000035","unstructured":"S. Hougardy, J. Silvanus, J. Vygen, Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm, CoRR abs\/1406.0492. URL http:\/\/arxiv.org\/abs\/1406.0492."},{"issue":"1","key":"10.1016\/j.orl.2016.10.010_br000040","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0130013","article-title":"On Steiner minimal trees with rectilinear distance","volume":"30","author":"Hwang","year":"1976","journal-title":"SIAM J. Appl. Math."},{"issue":"2\u20133","key":"10.1016\/j.orl.2016.10.010_br000045","first-page":"271","article-title":"Delay-related secondary objectives for rectilinear Steiner minimum trees","volume":"136","author":"J\u00f8rgensen","year":"2004","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.orl.2016.10.010_br000050","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01294129","article-title":"Balancing minimum spanning trees and shortest-path trees","volume":"14","author":"Khuller","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/j.orl.2016.10.010_br000055","series-title":"The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions","first-page":"445","author":"Ma\u00dfberg","year":"2015"},{"issue":"2","key":"10.1016\/j.orl.2016.10.010_br000060","first-page":"240","article-title":"Locating the vertices of a Steiner tree in an arbitrary metric space","volume":"9","author":"Rousseau","year":"1975","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.orl.2016.10.010_br000065","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/net.3230250206","article-title":"Thirty-five-point rectilinear Steiner minimal trees in a day","volume":"25","author":"Salowe","year":"1995","journal-title":"Networks"},{"key":"10.1016\/j.orl.2016.10.010_br000070","series-title":"Approximation and Online Algorithms: 12th International Workshop, WAOA 2014, Wroc\u0142aw, Poland, September 11\u201312, 2014","first-page":"224","article-title":"Steiner trees with bounded RC-delay","author":"Scheifele","year":"2015"},{"issue":"2\u20133","key":"10.1016\/j.orl.2016.10.010_br000075","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01758756","article-title":"How to find Steiner minimal trees in Euclidean d-space","volume":"7","author":"Smith","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/j.orl.2016.10.010_br000080","series-title":"Network Design: Connectivity and Facilities Location (Princeton, NJ, 1997)","first-page":"357","article-title":"A new exact algorithm for rectilinear Steiner trees","volume":"vol. 40","author":"Warme","year":"1998"},{"key":"10.1016\/j.orl.2016.10.010_br000085","series-title":"Steiner Trees in Industry","first-page":"467","article-title":"The rectilinear Steiner tree problem: a tutorial","volume":"vol. 11","author":"Zachariasen","year":"2001"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637716301481?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637716301481?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T01:56:37Z","timestamp":1536285397000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637716301481"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["S0167637716301481"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2016.10.010","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2016,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2016.10.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}