{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:04Z","timestamp":1759063744243},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427070"},{"type":"electronic","value":"9783540454779"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45477-2_18","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T11:09:01Z","timestamp":1187262541000},"page":"189-200","source":"Crossref","is-referenced-by-count":10,"title":["Multiple Hotlink Assignment"],"prefix":"10.1007","author":[{"given":"Sven","family":"Fuhrmann","sequence":"first","affiliation":[]},{"given":"Sven Oliver","family":"Krumke","sequence":"additional","affiliation":[]},{"given":"Hans-Christoph","family":"Wirth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"key":"18_CR1","unstructured":"P. Bose, J. Czyzowicz, L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc, and M. V. Martin \u00b7 Strategies for hotlink assignment \u00b7 Proceedings of the 11th Annual International Symposium on Algorithms and Computation (ISAAC\u201900), Lecture Notes in Computer Science, vol. 1969, Springer, 2001, pp. 23\u201334."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02060467","volume":"40","author":"O. Berman","year":"1992","unstructured":"O. Berman \u00b7 Improving the location of minisum facilities through network modification \u00b7 Annals of Operations Research 40 (1992), 1\u201316.","journal-title":"Annals of Operations Research"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Y. Dodis and S. Khanna \u00b7 Designing networks with bounded pairwise distance \u00b7 Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (STOC\u201999), 1999, pp. 750\u2013759.","DOI":"10.1145\/301250.301447"},{"issue":"2","key":"18_CR4","first-page":"270","volume":"10","author":"K. P. Eswaran","year":"1976","unstructured":"K. P. Eswaran and R. E. Tarjan \u00b7 Augmentation problems \u00b7 SIAM Journal on Computing 10 (1976), no. 2, 270\u2013283.","journal-title":"SIAM Journal on Computing"},{"volume-title":"Approximation algorithms for NP-hard problems","year":"1997","key":"18_CR5","unstructured":"D. S. Hochbaum (ed.) \u00b7 Approximation algorithms for NP-hard problems \u00b7 PWS Publishing Company, Boston, 1997."},{"key":"18_CR6","unstructured":"S. Khuller \u00b7 Approximation algorithms for finding highly connected subgraphs \u00b7 in [5], 1997."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45477-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:27:03Z","timestamp":1556771223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45477-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427070","9783540454779"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45477-2_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}