Quick approximation to matrices and applications

Combinatorica

Volumn 19, Issue 2, 1999, Pages 175-220

  Frieze, Alan ^a   Kannan, Ravi ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040942625     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050052     Document Type: Article

References (29)

1. N. ALON, R. A. DUKE, H. LEFMANN, V. RÖDL and R. YUSTER: The algorithmic aspects of the Regularity Lemma, Journal of Algorithms, 16 (1994), 80-109.
2. N. ALON, A. M.FRIEZE and D. WELSH: Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs, Random Structures and Algorithms, 6 (1995), 459-478.
3. N. ALON, J. SPENCER and P. ERDOS: The Probabilistic Method, John Wiley and Sons, New York, 1992.
4. J. ANNAN: A randomised approximation algorithm for counting the number of forests in dense graphs, Combinatorics, Probability and Computing, 3 (1994), 273-283.
5. S. ARORA, A. M. FRIEZE and H. KAPLAN: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, (1996), 21-30.
6. S. ARORA, D. KARGER and M. KARPINSKI: Polynomial time approximation schemes for dense instances of NP-hard problems, Proceedings of the 27th Annual ACM Symposium on Theory of Computing, (1995), 284-293.
7. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN and M. SZEGEDY: Proof verification and hardness of approximation problems, Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, (1992), 14-23.
8. A. Z. BRODER: How hard is it to marry at random? (On the approximation of the permanent), Proceedings of the 18th Annual ACM Symposium on Theory of Computing, (1986), 50-58. Erratum in: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, (1988), 551.
9. R. E. BURKARD and E. CELA: Quadratic and 3-dimensional assignment problems, In: Annotated Bibliographies in Combinatorial Optimization, (M Dell'Amico, F.Maffioli and S.Martello, eds.) to appear.
10. F. R. K. CHUNG: Regularity Lemmas for hypergraphs and quasi-randomness, Random Structures and Algorithms, 2 (1991), 241-252.
11. A. CZYGRINOW and V. RÖDL: Algorithmic Regularity Lemma for hypergraphs.
12. R. A. DUKE, H. LEFMANN and V. RÖDL: A fast approximation algorithm for computing the frequencies of subgraphs in a given graph, SIAM Journal on Computing, 24 (1995), 598-620.
13. M. E. DYER, A. M. FRIEZE and M. R. JERRUM: Approximately counting Hamilton cycles in dense graphs, Proceedings of the 4th Annual ACM/SIAM Symposium on Discrete Algorithms, (1994), 336-343.
14. W. FERNANDEZ-DE-LA-VEGA: MAX-CUT has a randomized approximation scheme in dense graphs, Random Structures and Algorithms, 8 (1996), 187-199.
15. P. FRANKL and V. RÖDL: The Uniformity Lemma for hypergraphs, Graphs and Combinatorics, 8 (1992), 309-312.
16. A. M. FRIEZE and R. KANNAN: The Regularity Lemma and approximation schemes for dense problems, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, (1996), 12-20.
17. M. R. GAREY, D. S. JOHNSON and L. STOCKMEYER: Some simplified NP-complete graph problems, Theoretical Computer Science, 1 (1976), 237-267.
18. M. X. GOEMANS and D. P. WILLIAMSON: .878-Approximation algorithms for MAX CUT and MAX 2SAT, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, ACM Press, (1994), 422-431.
19. O. GOLDREICH S. GOLDWASSER and D. RON: Property testing and its connection to learning and approximation, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, (1996), 339-348.
20. W. T. GOWERS: Lower bounds of tower type for Szemerédi's Uniformity Lemma, Geometric and Functional Analysis, 7 (1997), 322-337.
21. W. HOEFFDING: Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association, 58 (1963), 13-30.
22. M. R. JERRUM and A. SINCLAIR: Approximating the permanent, SIAM Journal on Computing, 18 (1989), 1149-1178.
23. I. KOMLÓS and M. SIMONOVITS: Szemerédi's Regularity Lemma and its applications in graph theory, Combinatorics, Paul Erdos is Eighty (Volume 2), Keszthely (Hungary), 1993, (D. Miklós, V. T. Sós, T. Szonyi eds.), Bolyai Society Mathematical Studies, 2, Budapest, 1996, 295-352.
24. I. KOMLÓS and M. SIMONOVITS: Szemerédi's Regularity Lemma and its applications in graph theory, Combinatorics, Paul Erdos is Eighty (Volume 2), Keszthely (Hungary), 1993, (D. Miklós, V. T. Sós, T. Szonyi eds.), Bolyai Society Mathematical Studies, 2, Budapest, 1996, 295-352.
25. C. H. PAPADIMITRIOU and M. YANNAKAKIS: Optimization, approximation and complexity classes, J. Comput. System Sci., 43 (1991), 425-440.
26. P. M. PARDALOS, F. RENDL and H. WOLKOWICZ: The quadratic assignment problem: a survey of recent developments, In: Quadratic assignment and related problems (P. Pardalos and H. Wolkowicz eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 16 (1994), 1-42.
27. H. J. PRÖMEL and A. STEGER: Excluding induced subgraphs III; a general asymptotic, Random Structures and Algorithms, 3 (1994), 19-31.
28. E.SZEMERÉDI: Regular partitions of graphs, Proceedings, Collogue Inter. CNRS (J.-C. Bermond, J.-C.Fournier, M.Las Vergnas and D.Sotteau, eds.), (1978), 399-401.
29. L. VALIANT: A theory of the learnable, Communications of the ACM, 27 (1984), 1134-1142.