Facility location problems: A parameterized view

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5034 LNCS, Issue , 2008, Pages 188-199

  Fellows, Michael ^a   Fernau, Henning ^a,b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; FACILITIES; HEURISTIC PROGRAMMING; INDUSTRIAL ENGINEERING; LINEAR PROGRAMMING; LINEARIZATION; MANAGEMENT SCIENCE;

ALGORITHMIC ASPECTS; COMPUTATIONAL BIOLOGY; FACILITY LOCATION PROBLEMS; FACILITY LOCATIONS; INTERNATIONAL CONFERENCES; PARAMETERIZED VIEW; RESEARCH COMMUNITIES; SEMI-STRUCTURED DOCUMENTS;

INFORMATION MANAGEMENT;

EID: 48249137697     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68880-8_19     Document Type: Conference Paper

References (14)

1. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Symposium on Theory of Computing STOC, pp. 67-74. ACM Press, New York (2007)
2. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed Möbius inversion and graphs of bounded degree. In: Symposium on Theoretical Aspects of Computer Science STACS, IBFI, Schloss Dagstuhl, Germany, pp. 85-96 (2008)
3. Bumb, A.: Approximation algorithms for facility location problems. PhD Thesis, Univ. Twente, The Netherlands (2002)
4. Cesati, M.: The Turing way to parameterized complexity. Journal of Computer and System Sciences 67, 654-685 (2003)
5. 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 65, 129-149 (2002)
6. Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Symposium on Discrete Algorithms SODA, pp. 642-651. ACM Press, New York (2001)
7. Conklin, D., Witten, I.H.: Complexity-based induction. Machine Learning 16, 203-225 (1994)
8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
9. Du, Q., Emelianenko, M., Ju, L.: Convergence of the Lloyd algorithm for computing centroidal Voronoi tessellations. SIAM Journal on Numerical Analysis 44, 102-119 (2006)
10. Fernau, H.: Extracting minimum length Document Type Definitions in NP-hard. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol. 3264, pp. 277-278. Springer, Heidelberg (2004)
11. Garofalakis, M., Gionis, A., Rastogi, R., Seshadri, S., Shim, K.: XTRACT: learning document type descriptors from XML document collections. Data Mining and Knowledge Discovery 7, 23-56 (2003)
12. 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-513 (2002), http://psb.stanford.edu/psb-online/proceedings/psb03/
13. Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Symposium on Theory of Computing STOC, pp. 265-274. ACM Press, New York (1997)
14. Young, N.E.: k-medians, facility location, and the Chernoff-Wald bound. In: Symposium on Discrete Algorithms SODA, pp. 86-95. ACM Press, New York (2000)