NP-Completeness: Reductions CSc 4520/6520 Fall 2013 Slides adapted from David Evans (Virgina) and Costas Busch (RPI)
Load Balancing Tasks with Overlapping Requirements Milan Vojnovic Microsoft Research Joint work with Dan Alistarh, Christos Gkantsidis, Jennifer Iglesias,
Complexity ©D.Moshkovitz 1 Paths On the Reasonability of Finding Paths in Graphs.
Lecture 8-9 More examples. SAT 3SAT VCPlanar 3SAT Knapsack PartitionHC3DM Integer Programming TSP.
