9532 search results - page 1759 / 1907 » Logic, Graphs, and Algorithms |
187
click to vote
FSTTCS
2003
Springer
15 years 10 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
141
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
163
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
160
click to vote
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper we introduce a novel graphical image representation comprising a single curve—the one-liner. The first step involves the detection and linking of image edges. We ...
153
click to vote
ICRA
2002
IEEE
15 years 10 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...