{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T00:40:12Z","timestamp":1776127212355,"version":"3.50.1"},"reference-count":24,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1002\/1097-0037(200101)37:1<8::aid-net2>3.0.co;2-r","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T21:46:18Z","timestamp":1030311978000},"page":"8-20","source":"Crossref","is-referenced-by-count":40,"title":["An improved approximation scheme for the Group Steiner Problem"],"prefix":"10.1002","volume":"37","author":[{"given":"C. S.","family":"Helvig","sequence":"first","affiliation":[]},{"given":"Gabriel","family":"Robins","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Zelikovsky","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"BIB1","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1109\/43.552083","volume":"15","author":"Alexander","year":"1996","journal-title":"IEEE Trans Computer-Aided Design"},{"key":"BIB2","author":"Alpert","year":"1993","unstructured":"and A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing, Proc IEEE Int Symp Circuits and Systems, Chicago, IL, May 1993, pp. 1869-1872."},{"key":"BIB3","author":"Awerbuch","year":"1990","unstructured":"and Cost-sensitive analysis of communication protocols, Proc ACM Symp Principles of Distributed Computing, 1990, pp. 177-187."},{"key":"BIB4","author":"Bateman","year":"1997","unstructured":"and Provably-good routing tree construction with multi-port terminals, Proc Int Symp on Physical Design, Napa Valley, CA, April 1997, pp. 96-102."},{"key":"BIB5","author":"Berman","year":"1992","unstructured":"and Improved approximations for the Steiner tree problem. Proc ACM\/SIAM Symp Discrete Algorithms, San Francisco, CA, Jan. 1992, pp. 325-334."},{"key":"BIB6","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1109\/43.137519","volume":"11","author":"Cong","year":"1992","journal-title":"IEEE Trans Comput-Aided Design"},{"key":"BIB7","author":"Feige","year":"1996","unstructured":"A threshold of ln n for approximating set cover, Proc ACM Symp on the Theory of Computing, May 1996, pp. 314-318."},{"key":"BIB8","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1109\/43.329264","volume":"13","author":"Griffith","year":"1994","journal-title":"IEEE Trans Comput-Aided Design"},{"key":"BIB9","author":"Helvig","year":"1998","unstructured":"and Improved approximation bounds for the group Steiner problem, Proc Conf on Design Automation and Test in Europe, Paris, France, Feb. 1998, pp. 406-413."},{"key":"BIB10","volume-title":"The Steiner tree problem","author":"Hwang","year":"1992","unstructured":"and The Steiner tree problem, North-Holland, Amsterdam, 1992."},{"key":"BIB11","series-title":"Lecture notes","first-page":"109","volume-title":"Bounds on the quality of approximate solutions to the group Steiner problem","volume":"484","author":"Ihler","year":"1991","unstructured":"Bounds on the quality of approximate solutions to the group Steiner problem, Lecture notes in computer science, Springer Verlag, 1991, Vol. 484, pp. 109-118."},{"key":"BIB12","author":"Ihler","year":"1991","unstructured":"The complexity of approximating the class Steiner tree problem, Technical report, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, 1991."},{"key":"BIB13","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/43.144853","volume":"11","author":"Kahng","year":"1992","journal-title":"IEEE Trans Computer-Aided Design"},{"key":"BIB14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2363-2","volume-title":"On optimal interconnections for VLSI","author":"Kahng","year":"1995","unstructured":"and On optimal interconnections for VLSI, Kluwer, Boston, MA, 1995."},{"key":"BIB15","author":"Khuller","year":"1993","unstructured":"and Balancing minimum spanning and shortest path trees, Proc ACM\/SIAM Symp Discrete Algorithms, Jan. 1993, pp. 243-250."},{"key":"BIB16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Info"},{"key":"BIB17","volume-title":"The traveling salesman problem: A guided tour of combinatorial optimization","author":"Lawler","year":"1985","unstructured":"and The traveling salesman problem: A guided tour of combinatorial optimization, Wiley, Chichester, New York, 1985."},{"key":"BIB18","volume-title":"Physical design automation of VLSI systems","author":"Preas","year":"1988","unstructured":"and Physical design automation of VLSI systems, Benjamin\/Cummings, Menlo Park, CA, 1988."},{"key":"BIB19","series-title":"Lecture notes","first-page":"196","volume-title":"Beyond Steiner's problem: A vlsi oriented generalization","volume":"411","author":"Reich","year":"1989","unstructured":"and Beyond Steiner's problem: A vlsi oriented generalization, Lecture notes in computer science, Springer Verlag, 1989, Vol. 411, pp. 196-211."},{"key":"BIB20","volume-title":"The traveling salesman: computational solutions for TSP applications","author":"Reinelt","year":"1994","unstructured":"The traveling salesman: computational solutions for TSP applications, Springer- Verlag, Berlin, Germany, 1994."},{"key":"BIB21","first-page":"573","volume":"24","author":"Takahashi","year":"1980","journal-title":"Math Jpn"},{"key":"BIB22","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"Zelikovsky","year":"1993","journal-title":"Algorithmica"},{"key":"BIB23","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0020-0190(93)90201-J","volume":"46","author":"Zelikovsky","year":"1993","journal-title":"Info Process Lett"},{"key":"BIB24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02523690","volume":"18","author":"Zelikovsky","year":"1997","journal-title":"Algorithmica"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1097-0037(200101)37:1%3C8::AID-NET2%3E3.0.CO;2-R","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1097-0037(200101)37:1%3C8::AID-NET2%3E3.0.CO;2-R","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:15:53Z","timestamp":1625134553000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"URL":"https:\/\/doi.org\/10.1002\/1097-0037(200101)37:1<8::aid-net2>3.0.co;2-r","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}