algorithms-optimization / Approximation algorithms
How well can an arbitrary boolean constraint satisfaction problem of arity $k$ be approximated in polynomial time? The paper gives a $(k/2^k)$-approximation, improving the previous best constant of $0.626612\,k/2^k$ due to Makarychev and Makarychev.
Temporal state
No reconciled state yet.
Append-only history
Removes the constant factor from the previous best guarantee; whether $k/2^k$ is optimal is not settled here.
Research memory
How well can an arbitrary boolean constraint satisfaction problem of arity $k$ be approximated in polynomial time? The paper gives a $(k/2^k)$-approximation, improving the previous best constant of $0.626612\,k/2^k$ due to Makarychev and Makarychev.
Removes the constant factor from the previous best guarantee; whether $k/2^k$ is optimal is not settled here.
Evidence graph
No public relationships recorded yet.