A New Approximation Algorithm for Finding Heavy Planar Subgraphs.
Gruia CalinescuCristina G. FernandesHoward J. KarloffAlexander ZelikovskyPublished in: Algorithmica (2003)
Keyphrases
- preprocessing
- np hard
- objective function
- detection algorithm
- improved algorithm
- approximation ratio
- high accuracy
- learning algorithm
- computational complexity
- search space
- clustering method
- cost function
- dynamic programming
- significant improvement
- computational cost
- optimal solution
- times faster
- theoretical analysis
- segmentation algorithm
- optimization algorithm
- polynomial time approximation
- matching algorithm
- input data
- linear programming
- simulated annealing
- experimental evaluation