activity
20162023
most citedAsynchronous Opinion Dynamics in Social Networks

4 citations · 8 across the 7 of their papers we have counts for

collaborators
Showing 2017 · cs.CCShow all

1 paper · 2 filters

cs.CC2017★ 1 cited

Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing

Sören Henning, Klaus Jansen, Malin Rau +1

We study the Parallel Task Scheduling problem with a constant number of machines. This problem is known to be strongly NP-complete for each , while i…