Combinatorial Approximation Algorithms for MaxCut using Random Walks.
Satyen KaleC. SeshadhriPublished in: ICS (2011)
Keyphrases
- approximation algorithms
- random walk
- np hard
- special case
- worst case
- vertex cover
- markov chain
- directed graph
- minimum cost
- disjoint paths
- markov random walk
- open shop
- randomized algorithms
- set cover
- primal dual
- combinatorial auctions
- approximation ratio
- spectral methods
- transition probability matrix
- link prediction
- polynomial time approximation