Tensor decomposition and approximation schemes for constraint satisfaction problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 747-754

  De La Vega, W Fernandez ^a   Karpinski, Marek ^b   Kannan, Ravi ^c   Vempala, Santosh ^d  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITY OF BONN   (Germany)

^c Computer Science ^*  (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation scheme; Tensor decomposition

Indexed keywords

APPROXIMATION SCHEME; SINGULAR VALUE DECOMPOSITION; TENSOR DECOMPOSITION; WEIGHTED GRAPH;

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

TENSORS;

EID: 34848897849     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060701     Document Type: Conference Paper

References (20)

1. N. Alon, W. Fernandez de la Vega, R. Kannan and M. Karpinski, Random Sampling and MAX-CSP Problems, Proc. 34th ACM STOC (2002), pp. 232-239.
2. S. Arora, D. Karger and M. Karpinski, Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems, Proc. 27th STOC (1995), pp. 284-293;
3. J. Computer and System Sciences 58 (1999), pp. 193-210.
4. W. Fernandez de la Vega, MAX-CUT has a Randomized Approximation Scheme in Dense Graphs, Random Structures and Algorithms 8 (1996), pp. 187-198.
5. W. Fernandez de la Vega and M. Karpinski, Polynomial time approximation of dense weighted instances of MAX-CUT, Random Structures and Algorithms 16 (2000), pp. 314-332.
6. W. Fernandez de la Vega and C. Kenyon, A randomized approximation scheme for metric MAX-CUT, Proc. 39th IEEE FOCS (1998), pp. 468-471,
7. final versi on in J. Computer and System Sciences 63 (2001), pp. 531-541.
8. W. Fernandez de la Vega, M. Karpinski, C. Kenyon and Y. Rabani, Approximation schemes for clustering problems, Proc. 35th ACM STOC (2003), pp. 50-58.
9. W. Fernandez de la Vega, M. Karpinski and C. Kenyon, Approximation Schemes for Metric Bisection and Partitioning, Proc. 15th ACM-SIAM SODA (2004), pp. 499-508.
10. A. M. Frieze and R. Kannan, The Regularity Lemma and Approximation Schemes for Dense Problems, Proc. 37th IEEE FOCS (1996), pp. 12-20.
11. A. M. Frieze and R. Kannan, Quick Approximation to Matrices and Applications, Combinatorica 19 (2) (1999), pp. 175-120.
12. A. M. Frieze, R. Kannan and S. Vempala, Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations, J. of the ACM 51(6) (2004), pp. 1025-1041.
13. O. Goldreich, S. Goldwasser and D. Ron, Property Testing and its Connection to Learning and Approximation, Proc. 37th IEEE FOCS (1996), pp. 339-348;
14. J. ACM 45 (1998), pp. 653-750.
15. P. Indyk, A Sublinear Time Approximation Scheme for Clustering in Metric Spaces, Proc. 40th IEEE FOCS (1999), pp. 154-159.
16. R. Macias and C. Segovia, Lipschitz functions on spaces of homogenous type, Advances in Mathematics 23 (1979), pp. 257-270.
17. F. McSherry, Spectral Partitioning of Random Graphs, FOCS 2001, pp.529-537
18. R. R. Mettu and C. G. Plaxton, The Online Median Problem, Proc. 41st IEEE FOCS (2000), pp. 339-348.
19. S. Sommes, A brief introduction to Gromov's notion of hyperbolic groups, Mathematics, arXiv: math CA/021341 (2003), pp. 1-10.
20. P. H. Sneath and R. R. Sokal, Numerical Taxonomy, Freeman, London, 1973.