248 search results - page 20 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
ALGORITHMICA
2002
14 years 11 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
161
click to vote
JCO
2006
14 years 11 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
114
click to vote
NETWORKS
2010
14 years 10 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
COLT
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...