Threshold-based preprocessing for approximating the weighted dense k-subgraph problem
We model the selection of key owners in forestry regions as dense k-subgraph problem. By a chain-reaction of vertex deletions, the size of the input graph is reduced. The reduced graph contains a (1+1/k)-approximate solution.
(i) graph theory or in forestry dense subgraph approximation algorithms