Dmitry Rybin (@DmitryRybin1) “Dinitz-Garg-Goemans conjecture is false. This graph theory problem was open for” — TopicDigg
Dmitry Rybin
@DmitryRybin1
Cofounder $100M AI Startup in Shenzhen, Algorithm Discovery + Math (we’re hiring) | ML PhD CUHK, BSc. Math HSE | IMC🥇National Math Olympiad🥇
加入 May 2022
250 正在关注 4.3K 粉丝
Dinitz-Garg-Goemans conjecture is false. This graph theory problem was open for ~30 years.
The graph below has fractional flow cost 58. Any unsplittable flow (with capacity violation <=15) has cost at least 60.
Chat with GPT 5.6 Pro where this was found:
显示更多
