Sciweavers

416 search results - page 84 / 84
» Audiences in argumentation frameworks
Sort
View
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
12 years 1 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx