New Approximation Algorithms for Minimum Cycle Bases of Graphs.
Telikepalli KavithaKurt MehlhornDimitrios MichailPublished in: Algorithmica (2011)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- undirected graph
- spanning tree
- np hard
- special case
- vertex cover
- worst case
- primal dual
- approximation ratio
- randomized algorithms
- approximation guarantees
- network flow
- facility location problem
- open shop
- bipartite graph
- graph matching
- approximation schemes
- set cover
- disjoint paths
- precedence constraints
- minimum weight
- np hardness
- weighted graph
- search algorithm
- graph structure
- constant factor approximation