Approximate Graph Colouring and the Hollow Shadow
Approximate Graph Colouring and the Hollow Shadow
复制标题
近似图形着色和空心阴影
DOI:
10.1145/3564246.3585112
复制
发表时间:
2023
期刊:
影响因子:
--
通讯作者:
Ciardo L
中科院分区:
文献类型:
--
作者:
Ciardo L
We show that approximate graph colouring is not solved by constantly many levels of the lift-and-project hierarchy for the combined basic linear programming and affine integer programming relaxation. The proof involves a construction of tensors whose fixed-dimensional projections are equal up to reflection and satisfy a sparsity condition, which may be of independent interest.
登录
查看更多内容
DOI:
--
发表时间:
2022
期刊:
--
影响因子:
--
作者:
Adam Ó Conghaile
通讯作者:
Adam Ó Conghaile
DOI:
10.4086/toc.2018.v014a010
发表时间:
2018
期刊:
Theory Comput.
影响因子:
--
作者:
Mrinalkanti Ghosh;Madhur Tulsiani
通讯作者:
Madhur Tulsiani
影响因子:
1.1
作者:
Charles R. Johnson;D. Stanford
通讯作者:
D. Stanford
DOI:
10.1137/1.9781611974782.21
发表时间:
2017
期刊:
影响因子:
--
作者:
C. Berkholz;M. Grohe
通讯作者:
M. Grohe
DOI:
10.1145/3055399.3055438
发表时间:
2016-10
期刊:
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
影响因子:
--
作者:
Pravesh Kothari;Raghu Meka;P. Raghavendra
通讯作者:
Pravesh Kothari;Raghu Meka;P. Raghavendra