Guus Regts

activity

20102026

most citedDeterministic polynomial-time approximation algorithms for partition functions and graph polynomials

115 citations · 254 across the 43 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros

Ferenc Bencs, Khallil Berrekkal, Guus Regts

Let $Δ, q \geq 3$ be integers. We prove that there exists $η \geq 0.002$ such that if $q \geq (2 - η) Δ$ , then there exists an open set $U \subset C$ that contains the i…

math.CO2024★ 1 cited

Approximating the volume of a truncated relaxation of the independence polytope

Ferenc Bencs, Guus Regts

Answering a question of Gamarnik and Smedira, we give a polynomial time algorithm that approximately computes the volume of a truncation of a relaxation of the independent set poly…

Deterministic approximate counting of colorings with fewer than 2Δ colors via absence of zeros

Approximating the volume of a truncated relaxation of the independence polytope

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros