{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:16:32Z","timestamp":1726514192368},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":5403,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0304-3975(98)00062-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"171-180","source":"Crossref","is-referenced-by-count":8,"title":["Approximations for subset interconnection designs"],"prefix":"10.1016","volume":"207","author":[{"given":"Xiufeng","family":"Du","sequence":"first","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Dean F.","family":"Kelley","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00062-0_BIB1","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the decidability of acyclic database schemes","volume":"30","author":"Beeri","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00062-0_BIB2","article-title":"Placement of valves in vacuum systems","volume":"4","author":"Du","year":"1976","journal-title":"J. Electric Light Sources"},{"key":"10.1016\/S0304-3975(98)00062-0_BIB3","article-title":"Generalized complexity cores and levelability of intractable sets","author":"Du","year":"1985"},{"key":"10.1016\/S0304-3975(98)00062-0_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0166-218X(86)90010-7","article-title":"An optimization problem","volume":"14","author":"Du","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(98)00062-0_BIB5","doi-asserted-by":"crossref","unstructured":"D.-Z. Du, D.F. Kelley, On complexity of subset interconnection designs, J. Global Optim., to appear.","DOI":"10.1007\/BF01096768"},{"key":"10.1016\/S0304-3975(98)00062-0_BIB6","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0401042","article-title":"Matroids and subset interconnection design","volume":"1","author":"Du","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(98)00062-0_BIB7","series-title":"Network Optimization Problems","first-page":"53","article-title":"Subset interconnection designs: generalization of spanning trees and Steiner trees","author":"Du","year":"1993"},{"key":"10.1016\/S0304-3975(98)00062-0_BIB8","first-page":"117","article-title":"Propriete de Helly et problemes de representation","author":"Duchet","year":"1978"},{"key":"10.1016\/S0304-3975(98)00062-0_BIB9","series-title":"The Steiner Tree Problem","author":"Hwang","year":"1992"},{"key":"10.1016\/S0304-3975(98)00062-0_BIB10","series-title":"Proc. 25th Annual ACM Symp. on the Theory of Computing","first-page":"286","article-title":"On the hardness of approximating minimization problems","author":"Lund","year":"1993"},{"key":"10.1016\/S0304-3975(98)00062-0_BIB11","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1002\/net.3230220406","article-title":"Two algorithms for the subset interconnection design","volume":"22","author":"Prisner","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(98)00062-0_BIB12","first-page":"21","article-title":"An optimality condition for minimum feasible graphs","volume":"2","author":"Tang","year":"1989","journal-title":"Appl. Math."},{"issue":"4","key":"10.1016\/S0304-3975(98)00062-0_BIB13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02579435","article-title":"An analysis of the greedy algorithm for the submodular set covering problem","volume":"2","author":"Wolsey","year":"1982","journal-title":"Combinatorica"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000620?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000620?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:27:03Z","timestamp":1556508423000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0304397598000620"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00062-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}