Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques.
Naveen GargSantosh S. VempalaAman SinglaPublished in: SODA (1993)
Keyphrases
- approximation algorithms
- lower bounding
- np hard
- lower bound
- branch and bound algorithm
- worst case
- dynamic time warping
- multi step
- special case
- minimum cost
- lower and upper bounds
- vertex cover
- mathematical programming
- edit distance
- primal dual
- approximation ratio
- upper bound
- optimal solution
- constant factor
- euclidean distance
- similarity search
- k nearest neighbor
- distance computation
- data structure
- linear programming
- undirected graph
- active learning