On Two Segmentation Problems

Journal of Algorithms

Volumn 33, Issue 1, 1999, Pages 173-184

  Alon, Noga ^a,b   Sudakov, Benny ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038046968     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1024     Document Type: Article

References (20)

1. M. Ajtai, J. Komlós, and E. Szemerédi, Deterministic simulation in logspace, in "Proc. of the 19th ACM STOC," pp. 132-140, Assoc. Comput. Mach., New York, 1987.
2. N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986), 83-96.
3. 1, isoperimetric inequalities for graphs and superconcentrators, J. Combin. Theory Ser. B 38 (1985), 73-88]
4. 1, isoperimetric inequalities for graphs and superconcentrators, J. Combin. Theory Ser. B 38 (1985), 73-88]
5. N. Alon and J. Spencer, "The Probabilistic Method," Wiley, New York, 1992.
6. A. Cohen and A. Wigderson, Dispersers, deterministic amplification, and weak random sources, in "Proc. of the 30th IEEE FOCS," pp. 14-19, IEEE Press, New York, 1989.
7. M. R. Garey and D. S. Johnson, "Computers and Intractability: a Guide to the Theory of script N sign℘-Completeness," Freeman, New York, 1979.
8. D. Gillman, A Chernoff bound for random walks on expander graphs, in "Proc. of the 34th IEEE FOCS," pp. 680-691, IEEE Press, New York, 1993. [SIAM J. of Computing 27 (1998), 1203-1220]
9. D. Gillman, A Chernoff bound for random walks on expander graphs, in "Proc. of the 34th IEEE FOCS," pp. 680-691, IEEE Press, New York, 1993. [SIAM J. of Computing 27 (1998), 1203-1220]
10. R. Impagliazzo and D. Zuckerman, How to recycle random bits, in "Proc. of the 30th IEEE FOCS," pp. 248-253, IEEE Press, New York, 1989.
11. J. Kleinberg, C. Papadimitriou, and P. Raghavan, Segmentation problems, in "Proc. of the 30th ACM STOC," pp. 473-482, Assoc. Comput. Mach., New York, 1998.
12. L. Lovász, Coverings and colorings of hypergraphs, in "Proc. 4th S.E. Conf. on Combinatorics, Graph Theory and Computing," 1973 [Utilitas Math., 3-12].
13. L. Lovász, Coverings and colorings of hypergraphs, in "Proc. 4th S.E. Conf. on Combinatorics, Graph Theory and Computing," 1973 [Utilitas Math., 3-12].
14. A. Lubotzky, R. Phillips, and P. Sarnak, Explicit expanders and the Ramanujan conjectures, in "Proc. of the 18th ACM Symp. on the Theory of Computing," pp. 240-246, 1986. [Ramanujan graphs, Combinatorial 8 (1988), 261-277]
15. A. Lubotzky, R. Phillips, and P. Sarnak, Explicit expanders and the Ramanujan conjectures, in "Proc. of the 18th ACM Symp. on the Theory of Computing," pp. 240-246, 1986. [Ramanujan graphs, Combinatorial 8 (1988), 261-277]
16. G. A. Margulis, Explicit grou-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators, in "Problemy Peredachi Informatsii," pp. 51-60, Vol. 24, 1988 (in Russian). (English translation in "Problems of Information Transmission," pp. 39-46, Vol. 24, 1988)
17. G. A. Margulis, Explicit grou-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators, in "Problemy Peredachi Informatsii," pp. 51-60, Vol. 24, 1988 (in Russian). (English translation in "Problems of Information Transmission," pp. 39-46, Vol. 24, 1988)
18. R. Motwani and P. Raghavan, "Randomized Algorithms," Cambridge Univ. Press, Cambridge, 1995.
19. A. Sinclair and M. R. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Inform, and Comput. 82 (1989), 93-133.
20. R. M. Tanner, Explicit construction of concentrators from generalized N-gons, SIAM J. Alg. Disc. Meth. 5 (1984), 287-293.