{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T06:38:37Z","timestamp":1774507117670,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0167-8191(95)00010-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:05:28Z","timestamp":1027627528000},"page":"369-382","source":"Crossref","is-referenced-by-count":37,"title":["Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine"],"prefix":"10.1016","volume":"22","author":[{"given":"Bruce","family":"Boldon","sequence":"first","affiliation":[]},{"given":"Narsingh","family":"Deo","sequence":"additional","affiliation":[]},{"given":"Nishit","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(95)00010-0_BIB1","author":"Ahuja","year":"1993"},{"key":"10.1016\/0167-8191(95)00010-0_BIB2","article-title":"Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine","author":"Boldon","year":"1995","journal-title":"Technical Report, Dept. of Comp. Science, Univ. of Central Florida, Orlando, CS-TR-95-02"},{"key":"10.1016\/0167-8191(95)00010-0_BIB3","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0377-2217(80)90164-2","article-title":"Complexity of spanning tree problems: Part I","volume":"5","author":"Camerini","year":"1980","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/0167-8191(95)00010-0_BIB4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(83)90014-8","article-title":"On the complexity of finding multi-constrained spanning trees","volume":"5","author":"Camerini","year":"1983","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/0167-8191(95)00010-0_BIB5","series-title":"Proc. Colloq. on the Theory of Algorithms","article-title":"The complexity of weighted constrained spanning trees","author":"Camerini","year":"1984"},{"key":"10.1016\/0167-8191(95)00010-0_BIB6","author":"Cormen","year":"1993"},{"key":"10.1016\/0167-8191(95)00010-0_BIB7","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/S0167-8191(05)80155-3","article-title":"Performance of parallel spanning tree algorithms on linear array of transputers and Unix systems","volume":"17","author":"Das","year":"1991","journal-title":"Par. Comput."},{"key":"10.1016\/0167-8191(95)00010-0_BIB8","year":"1992","journal-title":"DECmpp User's Guide (Programming Language, System Overview)"},{"key":"10.1016\/0167-8191(95)00010-0_BIB9","series-title":"Proc. 6th Ann. Allerton Conf.","first-page":"879","article-title":"The shortest generalized Hamiltonian tree","author":"Deo","year":"1968"},{"key":"10.1016\/0167-8191(95)00010-0_BIB10","series-title":"Proc. Int. Conf. Par. Process","first-page":"243","article-title":"Parallel algorithms for the minimum spanning tree problem","author":"Deo","year":"1980"},{"key":"10.1016\/0167-8191(95)00010-0_BIB11","first-page":"5","article-title":"Basic ideas of tabu search with an application to traveling salesman and quadratic assignment","volume":"62","author":"Fiechter","year":"1992","journal-title":"Ricerca Operativa"},{"key":"10.1016\/0167-8191(95)00010-0_BIB12","series-title":"Proc. 3rd Ann. ACM-SIAM SODA","first-page":"317","article-title":"Approximating the minimum degree spanning tree to within one from the optimal","author":"F\u00fcrer","year":"1992"},{"key":"10.1016\/0167-8191(95)00010-0_BIB13","author":"Garey","year":"1979"},{"issue":"3","key":"10.1016\/0167-8191(95)00010-0_BIB14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0377-2217(92)90317-3","article-title":"An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem","volume":"56","author":"Glover","year":"1992","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/0167-8191(95)00010-0_BIB15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","article-title":"On the history of minimum spanning tree problem","volume":"7","author":"Graham","year":"1985","journal-title":"Annals Hist. Comput."},{"key":"10.1016\/0167-8191(95)00010-0_BIB16","series-title":"Proc. 7th IEEE Symp. Par. Dist. Process.","article-title":"Efficient implementation of virtual processing for some combinatorial algorithms on the MasPar MP-1","author":"Hsu","year":"1995"},{"key":"10.1016\/0167-8191(95)00010-0_BIB17","series-title":"Computational Support for Discrete Mathematics, DIMACS Workshop","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1090\/dimacs\/015\/13","article-title":"Implementation of parallel graph algorithms on MasPar","volume":"15","author":"Hsu","year":"1994"},{"key":"10.1016\/0167-8191(95)00010-0_BIB18","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/5684.5686","article-title":"An empirical comparision of priority-queue and event-set implementations","volume":"29","author":"Jones","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(95)00010-0_BIB19","series-title":"Proc. 26th Ann. ACM STOCS","first-page":"412","article-title":"Low degree spanning tree of small weights","author":"Khuller","year":"1994"},{"key":"10.1016\/0167-8191(95)00010-0_BIB20","series-title":"Computational Support for Discrete Mathematics, DIMACS Workshop","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1090\/dimacs\/015\/19","article-title":"Improvements to GraphPack: A system to manipulate graphs and digraphs","volume":"15","author":"Krishnamoorthy","year":"1994"},{"key":"10.1016\/0167-8191(95)00010-0_BIB21","article-title":"Quadratic assignement problems: Solutions methods and applications","author":"Malucelli","year":"1993"},{"issue":"4","key":"10.1016\/0167-8191(95)00010-0_BIB22","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1137\/0906067","article-title":"On minimizing a set of tests","volume":"6","author":"Moret","year":"1985","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/0167-8191(95)00010-0_BIB23","first-page":"400","article-title":"An empirical analysis of algorithms for constructing minimum spanning tree","volume":"519","author":"Moret","year":"1991","journal-title":"LNCS"},{"key":"10.1016\/0167-8191(95)00010-0_BIB24","first-page":"192","article-title":"How to construct a minimum spanning tree in practice","volume":"555","author":"Moret","year":"1991","journal-title":"LNCS"},{"key":"10.1016\/0167-8191(95)00010-0_BIB25","series-title":"Computational Support for Discrete Mathematics, DIMACS Workshop","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/dimacs\/015\/09","article-title":"An empirical assessment of algorithms for constructing a minimum spanning tree","volume":"15","author":"Moret","year":"1994"},{"key":"10.1016\/0167-8191(95)00010-0_BIB26","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","article-title":"On two geometric problems related to traveling salesman problem","volume":"5","author":"Papadimitriou","year":"1984","journal-title":"J. Alg."},{"key":"10.1016\/0167-8191(95)00010-0_BIB27","series-title":"Proc. 25th Ann. ACM STOCS","first-page":"438","article-title":"Many birds with one stone: Multi-objective approximation algorithms","author":"Ravi","year":"1993"},{"issue":"4","key":"10.1016\/0167-8191(95)00010-0_BIB28","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB \u2014 A Traveling Salesman Problem library","volume":"2","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"issue":"3","key":"10.1016\/0167-8191(95)00010-0_BIB29","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several heuristics for the traveling salesman problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(95)00010-0_BIB30","doi-asserted-by":"crossref","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assignment problem","volume":"2","author":"Skorin-Kapov","year":"1990","journal-title":"ORSA J. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000100?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000100?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T05:50:01Z","timestamp":1555480201000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819195000100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0167819195000100"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(95)00010-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}