{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T15:11:38Z","timestamp":1676905898786},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0166-218x(96)00030-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"159-169","source":"Crossref","is-referenced-by-count":13,"title":["k-edge subgraph problems"],"prefix":"10.1016","volume":"74","author":[{"given":"Olivier","family":"Goldschmidt","sequence":"first","affiliation":[]},{"given":"Dorit S.","family":"Hochbaum","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00030-3_BIB1","series-title":"Proc. 27th Ann. ACM Symp. Theory Comput. (STOC 95)","article-title":"Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen","author":"Awerbuch","year":"1995"},{"key":"10.1016\/S0166-218X(96)00030-3_BIB2","series-title":"Proc. 26th Ann. ACM Symp. on the Theory of Computing","first-page":"432","article-title":"An O(log k) approximation algorithm for the k-minimum spanning tree problem in the plane","author":"Garg","year":"1994"},{"key":"10.1016\/S0166-218X(96)00030-3_BIB3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theory Comput. Sci."},{"key":"10.1016\/S0166-218X(96)00030-3_BIB4","article-title":"Finding a maximum density subgraph","author":"Goldberg","year":"1984"},{"key":"10.1016\/S0166-218X(96)00030-3_BIB5","article-title":"A Simulated Annealing Heuristic for the Semiconductor Components Assembly","author":"Goldschmidt","year":"1994"},{"key":"10.1016\/S0166-218X(96)00030-3_BIB6","series-title":"Node-optimal connected k-subgraphs manuscript","author":"Hochbaum","year":"1994"},{"key":"10.1016\/S0166-218X(96)00030-3_BIB7","first-page":"933","article-title":"A best possible parallel approximation algorithm to a graph theoretic problem","author":"Hochbaum","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00030-3_BIB8","series-title":"Proc. 34th Ann. Symp. on Foundations of Computer Science","article-title":"On choosing a dense subgraph","author":"Kortsarz","year":"1993"},{"key":"10.1016\/S0166-218X(96)00030-3_BIB9","article-title":"Guillotine subdivisions approximate polynomial subdivisions: a simple new method for the geometric k-MST problem","author":"Mitchell","year":"1995","journal-title":"Manuscript"},{"key":"10.1016\/S0166-218X(96)00030-3_BIB10","series-title":"Proc. 2nd Workshop on Algorithms and Data Structures","first-page":"355","article-title":"Facility dispersion problems: heuristics and special cases","volume":"Vol. 519","author":"Ravi","year":"1991"},{"key":"10.1016\/S0166-218X(96)00030-3_BIB11","series-title":"Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms","article-title":"Spanning trees short and small","author":"Ravi","year":"1994"},{"key":"10.1016\/S0166-218X(96)00030-3_BIB12","series-title":"Proc. 10th Ann. ACM Symp. on the Theory of Computing","first-page":"253","article-title":"Node-and edge-deletion NP-complete problems","author":"Yannakakis","year":"1978"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000303?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000303?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:28:39Z","timestamp":1556130519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0166218X96000303"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00030-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}