Wiener filters on graphs and distributed polynomial approximation algorithms.
Cong ZhengCheng ChengQiyu SunPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- minimum cost
- wiener filter
- vertex cover
- worst case
- facility location problem
- approximation guarantees
- distributed systems
- primal dual
- set cover
- constant factor
- approximation schemes
- randomized algorithms
- network design problem
- approximation ratio
- spanning tree
- precedence constraints
- np hardness
- open shop
- planar graphs
- graph matching
- combinatorial auctions
- constant factor approximation