SDP primal-dual approximation algorithms for directed hypergraph expansion and sparsest cut with product demands
From MaRDI portal
Publication:1791038
DOI10.1007/978-3-319-94776-1_57OpenAlexW2802093213MaRDI QIDQ1791038
Publication date: 4 October 2018
Full work available at URL: https://arxiv.org/abs/1805.02042
Semidefinite programming (90C22) Hypergraphs (05C65) Consumer behavior, demand theory (91B42) Approximation algorithms (68W25)
This page was built for publication: SDP primal-dual approximation algorithms for directed hypergraph expansion and sparsest cut with product demands