Maximum dispersion problem in dense graphs

DOI10.1016/S0167-6377(00)00058-4zbMath0991.90108WikidataQ126382651 ScholiaQ126382651MaRDI QIDQ5929139

Andrzej Czygrinow

Publication date: 2001

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmapproximationdispersion problemregularity lemmaweighted graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Complexity of finding dense subgraphs ⋮ An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs ⋮ The complexity of detecting fixed-density clusters

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for maximum dispersion
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• The Algorithmic Aspects of the Regularity Lemma
• Heuristic and Special Case Algorithms for Dispersion Problems
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• The dense \(k\)-subgraph problem

This page was built for publication: Maximum dispersion problem in dense graphs