Faster approximation algorithms for computing shortest cycles on weighted graphs.
Guillaume DucoffePublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- weighted graph
- shortest path
- np hard
- vertex cover
- special case
- worst case
- minimum cost
- set cover
- approximation ratio
- primal dual
- regularization framework
- graph structure
- minimum weight
- discrete data
- precedence constraints
- disjoint paths
- learning algorithm
- constant factor
- graph connectivity
- randomized algorithms
- data points
- lower bound
- training data