Baker game and polynomial-time approximation schemes

DOI10.1137/1.9781611975994.137OpenAlexW2906696900MaRDI QIDQ5146926

Zdeněk Dvořák

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

PTAS for Sparse General-valued CSPs

This page was built for publication: Baker game and polynomial-time approximation schemes