Optimal resource allocation in networks gives rise to some of the most fundamental problems at the intersection of algorithms, stochastic processes, and learning.
Tiling of a surface is acted upon by its automorphism group. The tilings with single vertex orbit, the transitive tilings, are well studied since antiquity.
Raghavendra's famous result from 2008 fully characterizes the inapproximability of every maximum constraint satisfaction problem (Max-CSP). However, the result inherently loses perfect completeness.
