Greedy approximation algorithms for finding dense components in a graph.
Moses CharikarPublished in: APPROX (2000)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- constant factor
- disjoint paths
- worst case
- special case
- greedy algorithm
- vertex cover
- minimum cost
- facility location problem
- set cover
- approximation schemes
- randomized algorithms
- greedy heuristic
- graph structure
- spanning tree
- network design problem
- quasi cliques
- constant factor approximation
- directed acyclic graph
- precedence constraints
- approximation ratio
- directed graph
- random walk
- open shop
- dynamic programming
- edge weights
- primal dual
- learning algorithm
- graph model
- weighted graph
- connected components
- upper bound
- optimal solution