{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:55:21Z","timestamp":1761893721535},"reference-count":17,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"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":9755,"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":[[1986,11]]},"DOI":"10.1016\/0166-218x(86)90041-7","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T12:34:42Z","timestamp":1032266082000},"page":"181-197","source":"Crossref","is-referenced-by-count":33,"title":["Most and least uniform spanning trees"],"prefix":"10.1016","volume":"15","author":[{"given":"Paolo M.","family":"Camerini","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[]},{"given":"Silvano","family":"Martello","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(86)90041-7_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0166-218X(86)90041-7_BIB2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","article-title":"The min-max spanning tree problem and some extensions","volume":"7","author":"Camerini","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(86)90041-7_BIB3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/net.3230090403","article-title":"A note on finding optimum branchings","volume":"9","author":"Camerini","year":"1979","journal-title":"Networks"},{"key":"10.1016\/0166-218X(86)90041-7_BIB4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/net.3230100202","article-title":"The K best spanning arborescences of a network","volume":"10","author":"Camerini","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0166-218X(86)90041-7_BIB5","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/0603048","article-title":"The bounded path tree problems","volume":"3","author":"Camerini","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(86)90041-7_BIB6","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":"Europ. J. Oper. Res."},{"key":"10.1016\/0166-218X(86)90041-7_BIB7","series-title":"Report no. 83\/4, IEE-LCE","article-title":"A note on most-uniform hyperarcs","author":"Camerini","year":"1983"},{"key":"10.1016\/0166-218X(86)90041-7_BIB8","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1287\/opre.32.2.380","article-title":"An algorithm for the bottleneck traveling salesman problem","volume":"39","author":"Carpaneto","year":"1984","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(86)90041-7_BIB9","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimum location of switching centers and the absolute centers and medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(86)90041-7_BIB10","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/0166-218X(86)90041-7_BIB11","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(86)90041-7_BIB12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6377(84)90061-0","article-title":"Balanced optimization problems","volume":"3","author":"Martello","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(86)90041-7_BIB13","series-title":"Working Paper, Krannert Graduate School of Management","article-title":"The product matrix traveling salesman problem: an application and solution heuristic","author":"Plante","year":"1985"},{"key":"10.1016\/0166-218X(86)90041-7_BIB14","series-title":"Working Paper, Krannert Graduate School of Management","article-title":"Partitioning and balancing for the assembly of vanes in gas turbine engines","author":"Plante","year":"1985"},{"key":"10.1016\/0166-218X(86)90041-7_BIB15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(86)90041-7_BIB16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230070103","article-title":"Finding optimum branchings","volume":"7","author":"Tarjan","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0166-218X(86)90041-7_BIB17","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","article-title":"Data Structures and Networks Algorithms","author":"Tarjan","year":"1983"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900417?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900417?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T13:22:47Z","timestamp":1554816167000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X86900417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":17,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["0166218X86900417"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(86)90041-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}