PTAS for Sparse General-Valued CSPs

We study polynomial-time approximation schemes (PTASes) for constraint satisfaction problems (CSPs) such as Maximum Independent Set or Minimum Vertex Cover on sparse graph classes.Baker's approach gives a PTAS on planar graphs, excluded-minor classes, and beyond. For Max-CSPs, and even more gen...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 11
Main Authors:	Mezei, Balazs F., Wrochna, Marcin, Zivny, Stanislav
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Computer science Minimization Physics
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!