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