4 citations · 12 across the 8 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 1 cited
Assigning channels via the meet-in-the-middle approach
Łukasz Kowalik, Arkadiusz Socała
We study the complexity of the Channel Assignment problem. By applying the meet-in-the-middle approach we get an algorithm for the -bounded Channel Assignment (when the edge…
cs.DS2014★ 1 cited
Tight lower bound for the channel assignment problem
Arkadiusz Socala
We study the complexity of the Channel Assignment problem. A major open problem asks whether Channel Assignment admits an -time algorithm, for a constant independent of…