{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:51:16Z","timestamp":1761893476993},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00090-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:07:13Z","timestamp":1027613233000},"page":"173-194","source":"Crossref","is-referenced-by-count":31,"title":["Class Steiner trees and VLSI-design"],"prefix":"10.1016","volume":"90","author":[{"given":"Edmund","family":"Ihler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Reich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00090-0_BIB1","series-title":"Proc. 33th Annual IEEE Symp. on Foundations of Comput. Sci.","first-page":"14","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB2","series-title":"Proc. 26th Annual ACM Symp. on Theory of Computing","first-page":"820","article-title":"Efficient probabilistically checkable proofs and applications to approximation","author":"Bellare","year":"1994"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","article-title":"The Steiner problem with edge lengths 1 and 2","volume":"32","author":"Bern","year":"1989","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/S0166-218X(98)00090-0_BIB4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/S0166-218X(98)00090-0_BIB5","series-title":"Proc. 28th Annual ACM Symp. on Theory of Computing","first-page":"314","article-title":"A threshold of In n for approximating set cover (preliminary version)","author":"Feige","year":"1996"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB6","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB7","series-title":"Computers and intractability: a Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB8","article-title":"Winter, The Steiner tree problem","volume":"53","author":"Hwang","year":"1992","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB9","series-title":"Proc. 17th Graph-Theoretic Concepts in Computer Science","first-page":"109","article-title":"Bounds on the quality of approximate solutions to the group Steiner problem","volume":"vol. 484","author":"Ihler","year":"1991"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB10","article-title":"Zur \u00dcbertragbarkeit von Approximationsalgorithmen f\u00fcr Optimierungsprobleme, insbesondere f\u00fcr das Problem Class Tree","author":"Ihler","year":"1993"},{"issue":"3","key":"10.1016\/S0166-218X(98)00090-0_BIB11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01582073","article-title":"The rectilinear class Steiner tree problem for intervals on two parallel lines","volume":"63","author":"Ihler","year":"1994","journal-title":"Mathematical Programming, Ser. B"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB12","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"A fast algorithm for Steiner trees","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/S0166-218X(98)00090-0_BIB14","series-title":"Proc. 25th Annual ACM Symp. on Theory of Computing","first-page":"14","article-title":"On the hardness of approximating minimization problems","author":"Lund","year":"1993"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB15","first-page":"185","article-title":"The Steiner problem in graphs","volume":"31","author":"Maculan","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(98)00090-0_BIB16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","article-title":"A faster approximation algorithm for the Steiner problem in graphs","volume":"27","author":"Mehlhorn","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(98)00090-0_BIB17","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-51486-4_58","article-title":"LEDA, a Library of Efficient Data types and Algorithms","author":"Mehlhorn","year":"1989"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB18","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(98)00090-0_BIB19","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/S0166-218X(98)00090-0_BIB20","article-title":"Zur Komplexit\u00e4t von Graphen- und geometrischen Problemen bei farbigen Knoten und Punkten: Effiziente Algorithmen und Heuristiken","author":"Reich","year":"1992"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB21","series-title":"Yet another floorplanner, Diplomarbeit","author":"Schiller","year":"1989"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB22","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"Takahashi","year":"1980","journal-title":"Math. Japonica"},{"key":"10.1016\/S0166-218X(98)00090-0_BIB23","author":"Van Leeuwen","year":"1990"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000900?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000900?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T11:23:33Z","timestamp":1556277813000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X98000900"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00090-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}