Maximum dispersion problem in dense graphs

Maximum dispersion problem in dense graphs

0.00 Avg rating0 Votes
Article ID: iaor20021365
Country: Netherlands
Volume: 27
Issue: 5
Start Page Number: 223
End Page Number: 227
Publication Date: Dec 2000
Journal: Operations Research Letters
Authors:
Abstract:

In this note, we present a polynomial-time approximation scheme for a ‘dense case’ of dispersion problem in weighted graphs, where weights on edges are integers from {1,...,K} for some fixed integer K. The algorithm is based on the algorithmic version of the regularity lemma.

Reviews

Required fields are marked *. Your email address will not be published.