45 search results - page 3 / 9 » Distortion Is Fixed Parameter Tractable |
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
CPM
2007
Springer
14 years 2 months ago
2007
Springer
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k - 1) other records ...
DAGSTUHL
2007
13 years 10 months ago
2007