1933 search results - page 152 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
171
click to vote
FSTTCS
2003
Springer
15 years 9 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...
146
Voted
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
142
click to vote
WSCG
2004
15 years 5 months ago
2004
The shape of a NURBS curve or patch is defined by the location of its control points, the weights associated with these points, and the parameter intervals, also called the knot v...
157
click to vote
PDPTA
2000
15 years 5 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
165
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...