248 search results - page 15 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
IJRR
2000
14 years 9 months ago
2000
The inverse kinematics problem is formulated as a parameterized autonomous dynamical system problem, and respective analysis is carried out. It is shown that a singular point of w...
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Captured CFA data by image sensors like CCD/or CMOS are often corrupted by noises. To produce high quality images acquired by CCD/CMOS digital cameras, the problem of noise needs ...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
113
click to vote
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
102
click to vote
ALGORITHMICA
2006
14 years 9 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...