A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs.
MohammadAli SafariMohammad R. SalavatipourPublished in: APPROX-RANDOM (2008)
Keyphrases
- constant factor approximation
- np hard
- approximation algorithms
- edge detection
- edge weights
- satisfy the triangle inequality
- minimum cost
- graph mining
- metric space
- distance measure
- edge information
- search space
- connected components
- edge detector
- total cost
- undirected graph
- fixed point
- multiscale
- spanning tree
- lower bound
- evaluation metrics
- distance metric