{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:06:01Z","timestamp":1771455961183,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540688655","type":"print"},{"value":"9783540688808","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_19","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"188-199","source":"Crossref","is-referenced-by-count":2,"title":["Facility Location Problems: A Parameterized View"],"prefix":"10.1007","author":[{"given":"Michael","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henning","family":"Fernau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"67","volume-title":"Symposium on Theory of Computing STOC","author":"A. Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets M\u00f6bius: fast subset convolution. In: Symposium on Theory of Computing STOC, pp. 67\u201374. ACM Press, New York (2007)"},{"key":"19_CR2","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed M\u00f6bius inversion and graphs of bounded degree. In: Symposium on Theoretical Aspects of Computer Science STACS, IBFI, Schloss Dagstuhl, Germany, pp. 85\u201396 (2008)"},{"key":"19_CR3","unstructured":"Bumb, A.: Approximation algorithms for facility location problems. PhD Thesis, Univ. Twente, The Netherlands (2002)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/S0022-0000(03)00073-4","volume":"67","author":"M. Cesati","year":"2003","unstructured":"Cesati, M.: The Turing way to parameterized complexity. Journal of Computer and System Sciences\u00a067, 654\u2013685 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.2002.1882","volume":"65","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Guha, S., Tardos, E., Shmoys, D.S.: A constant-factor approximation algorithm for the k-median problem. Journal of Computer and System Sciences\u00a065, 129\u2013149 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR6","first-page":"642","volume-title":"Symposium on Discrete Algorithms SODA","author":"M. Charikar","year":"2001","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Symposium on Discrete Algorithms SODA, pp. 642\u2013651. ACM Press, New York (2001)"},{"key":"19_CR7","first-page":"203","volume":"16","author":"D. Conklin","year":"1994","unstructured":"Conklin, D., Witten, I.H.: Complexity-based induction. Machine Learning\u00a016, 203\u2013225 (1994)","journal-title":"Machine Learning"},{"key":"19_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1137\/040617364","volume":"44","author":"Q. Du","year":"2006","unstructured":"Du, Q., Emelianenko, M., Ju, L.: Convergence of the Lloyd algorithm for computing centroidal Voronoi tessellations. SIAM Journal on Numerical Analysis\u00a044, 102\u2013119 (2006)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"19_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-30195-0_26","volume-title":"Grammatical Inference: Algorithms and Applications","author":"H. Fernau","year":"2004","unstructured":"Fernau, H.: Extracting minimum length Document Type Definitions in NP-hard. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol.\u00a03264, pp. 277\u2013278. Springer, Heidelberg (2004)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1021560618289","volume":"7","author":"M. Garofalakis","year":"2003","unstructured":"Garofalakis, M., Gionis, A., Rastogi, R., Seshadri, S., Shim, K.: XTRACT: learning document type descriptors from XML document collections. Data Mining and Knowledge Discovery\u00a07, 23\u201356 (2003)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Koivisto, M., Manila, H., Perola, M., Varilo, T., Hennah, W., Ekelund, J., Lukk, M., Peltonen, L., Ukkonen, E.: An MDL method for finding haplotype blocks and for estimating the strength of block boundaries. In: Pacific Symposium on Biocomputing 2003 (PSB 2003), pp. 502\u2013513 (2002), http:\/\/psb.stanford.edu\/psb-online\/proceedings\/psb03\/","DOI":"10.1142\/9789812776303_0047"},{"key":"19_CR13","first-page":"265","volume-title":"Symposium on Theory of Computing STOC","author":"D.B. Shmoys","year":"1997","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Symposium on Theory of Computing STOC, pp. 265\u2013274. ACM Press, New York (1997)"},{"key":"19_CR14","first-page":"86","volume-title":"Symposium on Discrete Algorithms SODA","author":"N.E. Young","year":"2000","unstructured":"Young, N.E.: k-medians, facility location, and the Chernoff-Wald bound. In: Symposium on Discrete Algorithms SODA, pp. 86\u201395. ACM Press, New York (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:01Z","timestamp":1620015421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}