site stats
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:
发布时间:
1
数据加载中
Markdown支持
评论加载中...
您可能感兴趣的: