SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands.
T.-H. Hubert ChanBintao SunPublished in: COCOON (2018)
Keyphrases
- approximation algorithms
- primal dual
- integrality gap
- semidefinite programming
- np hard
- affine scaling
- convex programming
- interior point methods
- special case
- valid inequalities
- interior point
- linear programming
- vertex cover
- worst case
- minimum cost
- algorithm for linear programming
- semi definite programming
- linear program
- linear programming relaxation
- approximation ratio
- convex optimization
- set cover
- np hardness
- pairwise
- semidefinite
- integer programming
- constant factor
- approximation guarantees
- undirected graph
- convergence rate
- higher order
- scheduling problem
- image segmentation
- production planning
- quadratic program
- message passing
- knapsack problem