Coresets for weighted facilities and their applications

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 315-324

  Feldman, Dan ^a   Fiat, Amos ^a   Sharif, Micha ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR SYSTEMS; PROBLEM SOLVING; REGRESSION ANALYSIS; SET THEORY;

GENERALIZED FACILITY LOCATION PROBLEMS; LINEAR FACILITIES; LINEAR REGRESSION PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 35348851254     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.22     Document Type: Conference Paper

References (25)

1. P. Agarwal, S. Har-Peled and K.R. Varadarajan, Approximating extent measures of points, J. ACM 51 (2004), 606-635.
2. P. K. Agarwal, S. Har-Peled and K. R. Varadarajan, Geometric approximation via coresets, in Current Trends in Combinatorial and Computational Geometry, (J.E. Goodman, J. Pach and E. Welzl, eds.), Cambridge University Press, New York, 2006, pp. 1-30.
3. V. Boltyanski, H. Martini and V. Soltan, Geometric Methods and Optimization Problems, Kluwer Academic Publishers, The Netherlands, 1999.
4. T.M. Breuel, Finding lines under bounded error, Pattern Recognition 29 (1996), 167-178.
5. M. Charikar, S. Khuller, D. M. Mount and G. Narasimhan, Algorithms for facility location problems with outliers, Proc. 12th Annu. ACM-SIAM Sympos. Discrete Algorithms, 2001, 642-651.
6. M. Charikar, L. O'Callaghan and R. Panigrahy, Better streaming algorithms for clustering problems, Proc. 35th Annu. ACM Sympos. Theory Comput., 2003, 30-39.
7. 1-regression, Proc. 16th Annu. ACM-SIAM Sympos. Discrete algorithms, 2005, 257-266.
8. T. K. Dey, Improved bounds for planar k-sets and related problems, Discrete Comput. Geom. 19 (1998), 373-382.
9. A. Deshpande, L. Rademacher, S. Vempala and G. Wang, Matrix approximation and projective clustering via volume sampling, Proc. 17th Annu. ACM-SIAM Sympos. Discrete Algorithms, 2006, 1117-1126.
10. Z. Drezner and H. W. Hamacher, (eds.), Facility Location: Applications and Theory, Springer Verlag, Heidelberg, 2002, pp. 20-22.
11. R. O. Duda, P. E. Hart and D. G. Stork, Pattern Classification, Wiley-Interscience, 2000, p. 115.
12. D. Feldman, Algorithms for Fitting Points by k Lines, M.Sc. Thesis, School of Computer Science, Tel-Aviv university, 2004
13. D. Feldman, A. Fiat and M. Sharir, Bicriteria approximations for k-line mean and k-line median, Manuscript, 2006; www.es.tau.ac.il/~dannyf
14. D. Feldman, A. Fiat, and M.Sharir, PTAS Algorithms for Approximating Points by Flats, Manuscript, 2006.
15. S. Har-Peled, Coresets for discrete integration and clustering, Manuscript, 2006.
16. S. Har-Peled and S. Mazumdar, On coresets for k-means and k-median clustering, Proc. 36th Annu. ACM Sympos. Theory computing, 2004, pp. 291-300.
17. A. Hyvärinen, E. Oja and J. Karhunen, Independent Component Analysis, Wiley-Interscience, 2001.
18. M. Kirby and L. Sirovich, Application of the Karhunen-Loeve Procedure for the Characterization of Human Faces., IEEE Trans. Pattern Anal. Mach. Intell., 1990, 103-108
19. S. Kolenikov and G. Angeles, The Use of Discrete Data in PCA: Theory, Simulations, and Applications to Socioeconomic Indices, Carolina PopulationCenter, University of North Carolina, Chapel Hill, 2004
20. N. Meggido and A. Tamir, Finding least-distance lines, SIAM J. Algebric Discrete Methods 4 (1983), 207-211.
21. J.A. Richards, Remote Sensing Digital Image Analysis, Springer-Verlag, 1986
22. A. Schöbel, Locating Lines and Hyperplanes: Theory and Algorithms, Springer-Verlag, New York, 1999.
23. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
24. J.S. Taur and C.W. Tao, Medical Image Compression using Principal Component Anlyasis, International Conference on Image Processing, IEEE International Conference on Image Processing (ICIP'96), 1996, 903-906
25. 1-linear approximation of points, Proc. 4th Annu. ACM Sympos. Comput. Geom., 1988, 352-361.