The algorithmic aspects of the regularity lemma
Journal of Algorithms
A Fast Approximation Algorithm for Computing theFrequencies of Subgraphs in a Given Graph
SIAM Journal on Computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Constructive Quasi-Ramsey Numbers and Tournament Ranking
SIAM Journal on Discrete Mathematics
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Approximation algorithms for maximum dispersion
Operations Research Letters
Complexity of finding dense subgraphs
Discrete Applied Mathematics
The complexity of detecting fixed-density clusters
Discrete Applied Mathematics
Dense subgraph problems with output-density conditions
ACM Transactions on Algorithms (TALG)
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
The complexity of detecting fixed-density clusters
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Dense subgraph problems with output-density conditions
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
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 the regularity lemma.