Maximum dispersion problem in dense graphs

Research output: Contribution to journalArticle

12 Scopus citations

Abstract

A polynomial-time approximation method for a dense case of dispersion problem in weighted graphs is presented, where weights on edges are integers from {1, ..., K} for some fixed integer K. The algorithm is based on the algorithmic version the regularity lemma.

Original languageEnglish (US)
Pages (from-to)223-227
Number of pages5
JournalOperations Research Letters
Volume27
Issue number5
DOIs
StatePublished - Dec 2000

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Maximum dispersion problem in dense graphs'. Together they form a unique fingerprint.

  • Cite this