Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
: Truly Linear FPT
Benjamin Merlin Bumpus, Rod Downey, Tala Eagling-Vose +7
Parameterized complexity has always been concerned with practical computing: by confining combinatorial explosion to a secondary parameter , one can uncover why and how many NP-…
cs.CC2025
Reconfigurable routing in data center networks
David C. Kutner, Iain A. Stewart
A hybrid network is a static (electronic) network that is augmented with optical switches. The Reconfigurable Routing Problem (RRP) in hybrid networks is the problem of finding set…