{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:43Z","timestamp":1763467783854,"version":"3.33.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,4,13]],"date-time":"2007-04-13T00:00:00Z","timestamp":1176422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,4,13]],"date-time":"2007-04-13T00:00:00Z","timestamp":1176422400000},"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 Heuristics"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10732-007-9015-5","type":"journal-article","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T18:02:37Z","timestamp":1176919357000},"page":"243-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Automated antenna positioning algorithms for wireless fixed-access networks"],"prefix":"10.1007","volume":"13","author":[{"given":"Yehuda","family":"Ben-Shimol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boaz","family":"Ben-Moshe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoav","family":"Ben-Yehezkel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Dvir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Segal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,13]]},"reference":[{"key":"9015_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1145\/263867.263869","volume":"44","author":"P.K. Agrawal","year":"1997","unstructured":"Agrawal, P.K., Har-Peled, S., Sharir, M., Varadarajan, K.R.: Approximate shortest paths on a convex polytope in three dimensions. J. ACM 44, 567\u2013584 (1997)","journal-title":"J. ACM"},{"key":"9015_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, H.R., McGeehan, J.P.: Optimizing microcell base station locations using simulated annealing techniques. In: Proc. of the IEEE Vehicular Technology Conference, pp. 858\u2013862 (1994)","DOI":"10.1109\/VETEC.1994.345212"},{"key":"9015_CR3","unstructured":"Available at http:\/\/www.alvarion.com\/"},{"key":"9015_CR4","unstructured":"Available at http:\/\/www.hexagonltd.com\/"},{"key":"9015_CR5","unstructured":"Available at http:\/\/www.schema.com\/"},{"key":"9015_CR6","unstructured":"Ben-Moshe, B.: Geometric facility location optimization, Ph.D. Thesis, Ben-Gurion University of the Negev (2004)"},{"key":"9015_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1006\/jagm.1994.1041","volume":"17","author":"P. Berman","year":"1994","unstructured":"Berman, P., Ramaiyer, V.: Improved approximations for the Steiner tree problem. J. Algorithms 17, 381\u2013408 (1994)","journal-title":"J. Algorithms"},{"key":"9015_CR8","volume-title":"Radio Propagation in Cellular Networks","author":"N. Blaunstein","year":"1999","unstructured":"Blaunstein, N.: Radio Propagation in Cellular Networks. Artech House, Boston (1999)"},{"key":"9015_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0304-3975(00)00245-0","volume":"263","author":"P. Calgeri","year":"2001","unstructured":"Calgeri, P., Kuonen, P., Nielsen, F.: Combinatorial optimization algorithms for radio network planning. Theor. Comput. Sci. 263, 235\u2013245 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"9015_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1287\/opre.14.3.361","volume":"14","author":"M.A. Efroymson","year":"1966","unstructured":"Efroymson, M.A., Ray, T.L.: A branch and bound algorithm for plant location. Oper. Res. 14, 361\u2013368 (1966)","journal-title":"Oper. Res."},{"key":"9015_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln\u2009n for approximating set cover (preliminary version). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 314\u2013318 (1996)","DOI":"10.1145\/237814.237977"},{"key":"9015_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1009690321348","volume":"4","author":"J.K. Hao","year":"1998","unstructured":"Hao, J.K., Dorne, R., Galinier, P.: Tabu search for frequency assignment in mobile radio networks. J. Heuristics 4, 47\u201362 (1998)","journal-title":"J. Heuristics"},{"key":"9015_CR13","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1137\/S0097539797325223","volume":"28","author":"S. Har-Peled","year":"1999","unstructured":"Har-Peled, S.: Constructing approximate shortest path maps in three dimensions. SIAM J. Comput. 28, 1187\u20131197 (1999)","journal-title":"SIAM J. Comput."},{"key":"9015_CR14","unstructured":"Hougardy, S., Pr\u00f6mel, H.J.: A 1.598 approximation algorithm for the Steiner problem in graphs. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 448\u2013453 (1999)"},{"key":"9015_CR15","volume-title":"The Steiner Tree Problem","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Elsevier, Amsterdam (1992)"},{"key":"9015_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"9015_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1009758919736","volume":"1","author":"M. Karpinsky","year":"1997","unstructured":"Karpinsky, M., Zelikovsky, A.: New approximation algorithms for the Steiner tree problem. J. Comb. Optim. 1, 47\u201365 (1997)","journal-title":"J. Comb. Optim."},{"key":"9015_CR18","series-title":"Handbook of Computational Geometry","volume-title":"Geometric Shortest Paths and Network Optimization","author":"J.S. Mitchell","year":"2000","unstructured":"Mitchell, J.S., Geometric Shortest Paths and Network Optimization. Handbook of Computational Geometry. North-Holland, Amsterdam (2000)"},{"key":"9015_CR19","doi-asserted-by":"crossref","unstructured":"Pr\u00f6mel, H.J., Steger, A.: RNC-approximation algorithms for the Steiner problem. In: Proc. Symposium on Theoretical Aspects of Computer Science, pp. 559\u2013570 (1997)","DOI":"10.1007\/BFb0023489"},{"key":"9015_CR20","doi-asserted-by":"crossref","unstructured":"Pr\u00f6mel, H.J., Steger, A., The Steiner Tree Problem: A Tour through Graphs, Algorithms and Complexity. Vieeg & Shohn (2002)","DOI":"10.1007\/978-3-322-80291-0"},{"key":"9015_CR21","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. Discret. Math. 19, 122\u2013134 (2005)","journal-title":"SIAM J. Discret. Math."},{"key":"9015_CR22","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/49.490417","volume":"14","author":"H.D. Sherali","year":"1996","unstructured":"Sherali, H.D., Pendyala, C.M., Rappaport, T.S.: Optimal location of transmitters for micro-cellular radio communication system design. IEEE J. Sel. Areas Commun. 14, 662\u2013673 (1996)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9015_CR23","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":"9015_CR24","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0166-218X(03)00451-7","volume":"136","author":"X. Tan","year":"2004","unstructured":"Tan, X.: Approximation algorithms for the watchman route and zookeeper\u2019s problems. J. Discret. Appl. Math. 136, 363\u2013376 (2004)","journal-title":"J. Discret. Appl. Math."},{"key":"9015_CR25","doi-asserted-by":"crossref","unstructured":"Tutschku, K.: Demand-based radio network planning of cellular mobile communication system. In: Infocom 98 Conference, pp. 1054\u20131061 (1998)","DOI":"10.1109\/INFCOM.1998.662915"},{"key":"9015_CR26","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1023\/A:1011373828276","volume":"7","author":"M. Vasquez","year":"2001","unstructured":"Vasquez, M., Hao, J.K.: A heuristic approach for antenna positioning in cellular networks. J. Heuristics 7, 443\u2013472 (2001)","journal-title":"J. Heuristics"},{"key":"9015_CR27","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A. Zelikovsky","year":"1993","unstructured":"Zelikovsky, A.: An 11\/6-approximation algorithm for the network Steiner problem. Algorithmica 9, 463\u2013470 (1993)","journal-title":"Algorithmica"},{"key":"9015_CR28","unstructured":"Zelikovsky, A., Better approximation bounds for the network and Euclidian Steiner Tree problems. University of Virginia, 1996, CS-96-06"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9015-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-007-9015-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9015-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9015-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T20:52:37Z","timestamp":1736974357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-007-9015-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,13]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["9015"],"URL":"https:\/\/doi.org\/10.1007\/s10732-007-9015-5","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2007,4,13]]},"assertion":[{"value":"16 November 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2006","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2006","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2007","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}