{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:42Z","timestamp":1725663162156},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_73","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:59:26Z","timestamp":1330189166000},"page":"221-233","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Generating and searching sets induced by networks"],"prefix":"10.1007","author":[{"given":"Greg N.","family":"Frederickson","sequence":"first","affiliation":[]},{"given":"Donald B.","family":"Johnson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"J. L. Bentley","year":"1976","unstructured":"Bentley, J. L. and A. C. Yao, An almost optimal algorithm for unbounded searching, Inf. Proc. Letters 5 (1976) 82\u201387.","journal-title":"Inf. Proc. Letters"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1972","unstructured":"Blum, M., R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan, Time bounds for selection, J. Comput. Sys. Sci. 7 (1972) 448\u2013461.","journal-title":"J. Comput. Sys. Sci."},{"key":"20_CR3","unstructured":"Chandrasekaran, R. and A. Daughtey, Problems of location on trees, Disc. Paper 357, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1978."},{"key":"20_CR4","unstructured":"Chandreskaran, R. and A. Tamir, Polynomially bounded algorithms for locating P-centers on a tree, Disc. Paper 358, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1978."},{"key":"20_CR5","unstructured":"Chandrasekaran, R. and A. Tamir, An 0((nlogP)2) algorithm for the continuous P-center problem on a tree, Disc. Paper 367, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1978."},{"key":"20_CR6","unstructured":"Frederickson, G. N. and D. B. Johnson, Optimal algorithms for generating quantile information in X+Y and matrices with sorted columns, Proc. 13th Ann. Conf. on Inf. Sci. and Sys., The Johns Hopkins U. (1979) 47\u201352."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Frederickson, G. N. and D. B. Johnson, Generalized selection and ranking, Proceedings 12th Ann. ACM Symp. Theory Comput., April 1980, (to appear).","DOI":"10.1145\/800141.804690"},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"A. J. Goldman","year":"1971","unstructured":"Goldman, A. J., Optimal center location in simple networks, Transp. Sci. 5 (1971) 212\u2013221.","journal-title":"Transp. Sci."},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/trsc.6.4.407","volume":"6","author":"A. J. Goldman","year":"1972","unstructured":"Goldman, A. J., Minimax location of a facility in an undirected tree graph, Transp. Sci. 6 (1972) 407\u2013418.","journal-title":"Transp. Sci."},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S. L. Hakimi","year":"1964","unstructured":"Hakimi, S. L., Optimum locations of switching centers and the absolute centers and medians of a graph, Opns. Res. 12 (1964) 450\u2013459.","journal-title":"Opns. Res."},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"S. L. Hakimi","year":"1965","unstructured":"Hakimi, S. L., Optimal distribution of switching centers in a communications network and some related graph theoretic problems, Opns. Res. 13 (1965) 462\u2013475.","journal-title":"Opns. Res."},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"G. Y. Handler","year":"1973","unstructured":"Handler, G. Y., Minimax location of a facility in an undirected tree graph, Transp. Sci. 7 (1973) 287\u2013293.","journal-title":"Transp. Sci."},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/trsc.12.2.93","volume":"12","author":"G. Y. Handler","year":"1978","unstructured":"Handler, G. Y., Finding two-centers of a tree: the continuous case, Transp. Sci. 12 (1978) 93\u2013106.","journal-title":"Transp. Sci."},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O. and S. L. Hakimi, An algorithmic approach to network location problems, SIAM J. Appl. Math. 37 (Dec. 1979) 513\u2013538.","journal-title":"SIAM J. Appl. Math."},{"key":"20_CR15","unstructured":"Megiddo, N., A. Tamir, E. Zemel, and R. Chandrasekaran, An O(nlog2n) algorithm for the kth longest path in a tree with applications to location problems, Disc. Paper 379, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1979."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:30:48Z","timestamp":1578526248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_73"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]},"assertion":[{"value":"24 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}