2 problems

The 1.25 speedup conjecture for unicasts and broadcasts
Consider a $K\times N$ switch with traffic patterns consisting only of unicasts and broadcasts. The 1.25 speedup conjecture. The minimum speedup required to achieve $100\%$ through…
openmulticast-switching network-coding
0 responses
04
The enhanced conflict graph extreme-point conjecture for 2×N switches
Consider a $2\times N$ switch with traffic consisting of unicasts and broadcasts, and let $G$ be its enhanced conflict graph. Let $QSTAB(G)$ denote the fractional stable set polyto…
openmulticast-switching network-coding polyhedral-combinatorics
0 responses
03

The 1.25 speedup conjecture for unicasts and broadcasts