Performance of a greedy algorithm for edge covering by cliques in interval graphs
Gabrio CaimiHolger FlierMartin FuchsbergerMarc NunkesserPublished in: CoRR (2008)
Keyphrases
- greedy algorithm
- weighted graph
- maximal cliques
- graph structure
- greedy algorithms
- worst case
- undirected graph
- dynamic programming
- objective function
- greedy approximation algorithm
- shortest path
- edge detection
- approximation guarantees
- influence maximization
- maximum clique
- graph theory
- greedy heuristic
- approximation ratio
- greedy strategy
- knapsack problem
- complex networks
- set cover
- submodular functions