Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs.
Guillaume DucoffePublished in: ICALP (2019)
Keyphrases
- approximation algorithms
- weighted graph
- shortest path
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- regularization framework
- approximation ratio
- set cover
- randomized algorithms
- spanning tree
- open shop
- graph connectivity
- constant factor
- edge weights
- undirected graph
- discrete data
- disjoint paths
- constant factor approximation
- minimum weight
- precedence constraints
- primal dual
- graph structure
- polynomial time approximation
- data objects
- data structure