Minimizing the union: tight approximations for small set bipartite vertex expansion. (English) Zbl 1411.68184
Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 881-899 (2017).
MSC:
| 68W25 | Approximation algorithms |
| 05C65 | Hypergraphs |
| 05C85 | Graph algorithms (graph-theoretic aspects) |
| 68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
| 68Q25 | Analysis of algorithms and problem complexity |
| 90C27 | Combinatorial optimization |
