Maximum dispersion problem in dense graphs

Operations Research Letters

Volumn 27, Issue 5, 2000, Pages 223-227

  Czygrinow, A ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

POLYNOMIAL-TIME APPROXIMATION METHOD; REGULARITY LEMMA;

OPERATIONS RESEARCH;

EID: 0034504118     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(00)00058-4     Document Type: Article

References (11)

1. Alon N., Duke R.A., Lefmann H., Rödl V., Yuster R. The algorithmic aspects of the regularity lemma. J. Algorithms. 16:1994;80-109.
2. S. Arora, D. Krager, 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, pp. 284-293.
3. A. Czygrinow, S. Poljak, V. Rödl, Constructive quasi-Ramsey numbers and tournament ranking, SIAM J. Discrete Math. 12(1) (1999) 48-63.
4. Duke R.A., Lefmann H., Rödl V. A fast algorithm for computing frequencies in a given graph. SIAM J. Comput. 24(3):1995;598-620.
5. U. Feige, G. Kortsarz, D. Peleg, The dense k -subgraph problem, manuscript, 1999.
6. A. Frieze, R. Kannan, The regularity lemma and approximation schemes for dense problems, Proceedings of the 37th FOCS, 1996, pp. 12-20.
7. Hassin R., Rubinstein S., Tamir A. Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21:1997;133-137.
8. J. Komlós, M. Simonovits, Szemerédi's regularity lemma and its applications in graph theory, in: D. Miklós, V.T. Sós, T. Szonyi (Eds.), Combinatorics, Paul Erdos is Eighty, Vol. 2, János Bolyai Math. Soc., Budapest, 1996, pp. 295-352.
9. G. Kortsarz, D. Peleg, On choosing a dense subgraph, Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 692-701.
10. Ravi S.S., Rosenkrantz D.J., Tayi G.K. Heuristic and special case algorithms for dispersion problems. Oper. Res. 42:1994;299-310.
11. E. Szemerédi, Regular Partitions of Graphs, Colloques Internationaux C.N.R.S., Problemes Combinatories et Theorie des Graphes, 1978, pp. 399-402.