scientific article; zbMATH DE number 6850402

zbMath1403.68149arXiv1801.04497MaRDI QIDQ4607982

Amey Bhangale, Devanathan Thimvenkatachari, Sushant Sachdeva, Swastik Kopparty, Subhash A. Khot

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1801.04497

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (2)

Simultaneous max-cut is harder to approximate than max-cut ⋮ Socially fair network design via iterative rounding

This page was built for publication: