Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs.
Guillaume DucoffePublished in: SIAM J. Discret. Math. (2021)
Keyphrases
- approximation algorithms
- weighted graph
- shortest path
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- approximation ratio
- open shop
- set cover
- data objects
- spanning tree
- primal dual
- randomized algorithms
- constant factor
- minimum weight
- discrete data
- regularization framework
- edge weights
- graph structure
- planar graphs
- polynomial time approximation
- combinatorial auctions
- disjoint paths
- constant factor approximation