{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:35:34Z","timestamp":1648989334068},"reference-count":19,"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)00016-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:03:07Z","timestamp":1027623787000},"page":"576-585","source":"Crossref","is-referenced-by-count":6,"title":["On the multidensity gateway location problem for a multilevel high speed internetwork"],"prefix":"10.1016","volume":"20","author":[{"given":"Debashis","family":"Saha","sequence":"first","affiliation":[]},{"given":"Amitava","family":"Mukherjee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(97)00016-9_BIB1","doi-asserted-by":"crossref","unstructured":"C.A. Sunshine, Network interconnection and gateways, IEEE Journal Select. Areas Communication 8 (1) (1990) 4\u201311.","DOI":"10.1109\/49.46841"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB2","unstructured":"P.E. Green (Ed.), Computer Network Interconnection and Protocol Conversion, IEEE Reprint series, IEEE Press, 1988."},{"key":"10.1016\/S0140-3664(97)00016-9_BIB3","doi-asserted-by":"crossref","unstructured":"D. Saha, A. Mukherjee, Design of hierarchical computer communication networks under node\/link failure constraints, Computer Communications 18 (1995) 871\u2013875.","DOI":"10.1016\/0140-3664(95)96839-I"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB4","doi-asserted-by":"crossref","unstructured":"S. Narasimhan, H. Pirkul, Hierarchical concentrator location problem, Computer Commununications 15 (3) (1992) 185\u2013191.","DOI":"10.1016\/0140-3664(92)90079-T"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB5","doi-asserted-by":"crossref","unstructured":"P. McGregor, D. Shen, Network design: An algorithm for access facility location problem, IEEE Trans. Communication 25 (1977).","DOI":"10.1109\/TCOM.1977.1093710"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB6","doi-asserted-by":"crossref","unstructured":"G.M. Schneider, M.N. Zastrow, An algorithm for the design of multilevel concentrator networks, Comput Networks 6 (1982) 1\u201311.","DOI":"10.1016\/0376-5075(82)90118-0"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB7","unstructured":"V.K. Konangi, T. Aidja, C.R. Dhas, On the multilevl concentrator location problem for local access networks, in: Proc IEEE Globecom 1984, pp. 912\u2013915."},{"key":"10.1016\/S0140-3664(97)00016-9_BIB8","doi-asserted-by":"crossref","unstructured":"M. Zitterbart, A.N. Tantawy, D.N. Serpanos, A high performance transparent bridge, IEEE\/ACM Trans Networking 2 (4) (1994) 352\u2013362.","DOI":"10.1109\/90.330416"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB9","doi-asserted-by":"crossref","unstructured":"B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, Journal of the ACM 30 (1983) 118\u2013132.","DOI":"10.1145\/322358.322367"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB10","doi-asserted-by":"crossref","unstructured":"H. Pirkul, S. Narasimhan, P. De, Locating concentrators for primary and secondary coverage in a computer communications network, IEEE Trans. Communication 36 (4) (1988) 450\u201358.","DOI":"10.1109\/26.2769"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB11","doi-asserted-by":"crossref","unstructured":"S. Sherkar, Fundamental design issues for the future Internet, IEEE Journal Select. Areas Communication 13 (7) (1995) 1176\u20131188.","DOI":"10.1109\/49.414637"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB12","doi-asserted-by":"crossref","unstructured":"E.W. Zegura, K.L. Calvert, S. Bhattacharjee, How to model an internetwork, in: Proc of INFOCOM'96, California, USA, 1996.","DOI":"10.1109\/INFCOM.1996.493353"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB13","doi-asserted-by":"crossref","unstructured":"M.L. Fisher, An applications oriented guide to Lagrangean relaxation, Interfaces 15 (1985) 10\u201321.","DOI":"10.1287\/inte.15.2.10"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB14","doi-asserted-by":"crossref","unstructured":"H. Held, P. Wolfe, H.P. Crowder, Validation of subgradient optimization, Mathematical Programming 5 (1974) 62\u201368.","DOI":"10.1007\/BF01580223"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB15","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"10.1016\/S0140-3664(97)00016-9_BIB16","doi-asserted-by":"crossref","unstructured":"D. Saha, A. Mukherjee, S.K. Dutta, Capacity assignment in computer communication networks with reliable links, Computer Communications 17 (1994) 871\u2013875.","DOI":"10.1016\/0140-3664(94)90030-2"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB17","doi-asserted-by":"crossref","unstructured":"A. Mirzaian, Lagrangean relaxation for the star-star concentrator location problem: Approximation algorithms and bounds, Networks (1985) 1\u201320.","DOI":"10.1002\/net.3230150102"},{"key":"10.1016\/S0140-3664(97)00016-9_BIB18","unstructured":"D. Saha, A. Mukherjee, Some studies on the internetworking problem for connecting high speed local networks, Internal Report, JU, CSE, India, 1994."},{"key":"10.1016\/S0140-3664(97)00016-9_BIB19","doi-asserted-by":"crossref","unstructured":"C.H. Papadimitrian, The complexity of the capacitated tree problem, Networks 8 (1978) 217\u2013230.","DOI":"10.1002\/net.3230080306"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000169?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000169?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T03:01:18Z","timestamp":1555988478000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497000169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0140366497000169"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)00016-9","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}