{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:49:48Z","timestamp":1648979388016},"reference-count":5,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0140-3664(97)00046-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:08:03Z","timestamp":1027584483000},"page":"521-527","source":"Crossref","is-referenced-by-count":0,"title":["Fast heuristics for practical TDM network design"],"prefix":"10.1016","volume":"20","author":[{"given":"G.P.","family":"Ray","sequence":"first","affiliation":[]},{"given":"P.W.","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"C.T.","family":"Stockel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(97)00046-7_BIB1","doi-asserted-by":"crossref","unstructured":"Y.K. Agarwal, An algorithm for designing survivable networks, AT&T Tech. J. (May-June 1989).","DOI":"10.1002\/j.1538-7305.1989.tb00320.x"},{"key":"10.1016\/S0140-3664(97)00046-7_BIB2","doi-asserted-by":"crossref","unstructured":"Johnson, Lenstra, Rinooy Kan, The complexity of the network design problem, Networks 8 (1978).","DOI":"10.1002\/net.3230080402"},{"key":"10.1016\/S0140-3664(97)00046-7_BIB3","doi-asserted-by":"crossref","unstructured":"H. Frank, W. Chou, Topological optimisation of computer networks, Proc. IEEE 60 (1972) 1385\u20131397.","DOI":"10.1109\/PROC.1972.8910"},{"key":"10.1016\/S0140-3664(97)00046-7_BIB4","doi-asserted-by":"crossref","unstructured":"M. Gerla, L. Kleinrock, On the topological design of distributed computer networks, IEEE Trans. Commun. COM-25 (1) (1977).","DOI":"10.1109\/TCOM.1977.1093709"},{"key":"10.1016\/S0140-3664(97)00046-7_BIB5","unstructured":"B.M.E. Moret, H.D. Shapiro, Algorithms from P to NP, vol. 1, Benjamin\/Cummings, 1991."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000467?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000467?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T21:27:49Z","timestamp":1556659669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497000467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":5,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0140366497000467"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)00046-7","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}