1554 search results - page 16 / 311 » Parameterized Complexity and Approximation Algorithms |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
CVPR
2008
IEEE
16 years 1 days ago
2008
IEEE
When rotating a pinhole camera, images are related by the infinite homography KRK-1 , which is algebraically a conjugate rotation. Although being a very common image transformatio...
102
click to vote
ICDM
2005
IEEE
15 years 3 months ago
2005
IEEE
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
102
click to vote
ISAAC
2010
Springer
14 years 8 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...