4 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DS2016★ 4 cited
Approximation and Parameterized Complexity of Minimax Approval Voting
Marek Cygan, Łukasz Kowalik, Arkadiusz Socała +1
We present three results on the complexity of Minimax Approval Voting. First, we study Minimax Approval Voting parameterized by the Hamming distance from the solution to the vo…
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…