{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:32:51Z","timestamp":1699835571811},"reference-count":10,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":9355,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1981,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Horn's algorithm for weighted mean flow scheduling with treelike precedence constraints is reexamined. A new analysis of an efficient implementation of Horn's algorithm shows an <jats:italic>O(n<\/jats:italic> log <jats:italic>n)<\/jats:italic> complexity. This is an improvement on the known <jats:italic>O(n<jats:sup>2<\/jats:sup>)<\/jats:italic> complexity of this algorithm. An application of Horn's algorithm to a problem of optimal scheduling of a treelike communication network is presented.<\/jats:p>","DOI":"10.1002\/net.3230110111","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T12:02:49Z","timestamp":1178884969000},"page":"87-92","source":"Crossref","is-referenced-by-count":1,"title":["Mean flow scheduling and optimal construction of a treelike communication network"],"prefix":"10.1002","volume":"11","author":[{"given":"Yehoshua","family":"Perl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaacov","family":"Yesha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0125042"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0206002"},{"key":"e_1_2_1_4_2","volume-title":"Computer and Job\u2010Shop Scheduling Theory","author":"Coffman E. G.","year":"1976"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90113-1"},{"key":"e_1_2_1_6_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/0123021"},{"key":"e_1_2_1_8_2","volume-title":"Fundamental Algorithms","author":"Knuth D. M.","year":"1969"},{"key":"e_1_2_1_9_2","volume-title":"Sorting and Searching","author":"Knuth D. M.","year":"1969"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70323-6"},{"key":"e_1_2_1_11_2","first-page":"357","article-title":"Finding a Spanning Tree of a Graph with Maximal Number of Terminal Vertices","volume":"9","author":"Zelinka B.","year":"1973","journal-title":"Kybernetika"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230110111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230110111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T12:14:57Z","timestamp":1699791297000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230110111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,3]]}},"alternative-id":["10.1002\/net.3230110111"],"URL":"https:\/\/doi.org\/10.1002\/net.3230110111","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,3]]}}}