A Dichotomy for Maximum PCSPs on Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911474783354880 |
|---|---|
| author | Nakajima, Tamio-Vesa Živný, Stanislav |
| author_facet | Nakajima, Tamio-Vesa Živný, Stanislav |
| contents | Fix two non-empty loopless graphs $G$ and $H$ such that $G$ maps homomorphically to $H$. The Maximum Promise Constraint Satisfaction Problem parameterised by $G$ and $H$ is the following computational problem, denoted by MaxPCSP($G$, $H$): Given an input (multi)graph $X$ that admits a map to $G$ preserving a $ρ$-fraction of the edges, find a map from $X$ to $H$ that preserves a $ρ$-fraction of the edges. As our main result, we give a complete classification of this problem under Khot's Unique Games Conjecture: The only tractable cases are when $G$ is bipartite and $H$ contains a triangle.
Along the way, we establish several results, including an efficient approximation algorithm for the following problem: Given a (multi)graph $X$ which contains a bipartite subgraph with $ρ$ edges, what is the largest triangle-free subgraph of $X$ that can be found efficiently? We present an SDP-based algorithm that finds one with at least $0.8823 ρ$ edges, thus improving on the subgraph with $0.878 ρ$ edges obtained by the classic Max-Cut algorithm of Goemans and Williamson. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_20069 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Dichotomy for Maximum PCSPs on Graphs Nakajima, Tamio-Vesa Živný, Stanislav Data Structures and Algorithms Computational Complexity Discrete Mathematics Fix two non-empty loopless graphs $G$ and $H$ such that $G$ maps homomorphically to $H$. The Maximum Promise Constraint Satisfaction Problem parameterised by $G$ and $H$ is the following computational problem, denoted by MaxPCSP($G$, $H$): Given an input (multi)graph $X$ that admits a map to $G$ preserving a $ρ$-fraction of the edges, find a map from $X$ to $H$ that preserves a $ρ$-fraction of the edges. As our main result, we give a complete classification of this problem under Khot's Unique Games Conjecture: The only tractable cases are when $G$ is bipartite and $H$ contains a triangle. Along the way, we establish several results, including an efficient approximation algorithm for the following problem: Given a (multi)graph $X$ which contains a bipartite subgraph with $ρ$ edges, what is the largest triangle-free subgraph of $X$ that can be found efficiently? We present an SDP-based algorithm that finds one with at least $0.8823 ρ$ edges, thus improving on the subgraph with $0.878 ρ$ edges obtained by the classic Max-Cut algorithm of Goemans and Williamson. |
| title | A Dichotomy for Maximum PCSPs on Graphs |
| topic | Data Structures and Algorithms Computational Complexity Discrete Mathematics |
| url | https://arxiv.org/abs/2406.20069 |