7129 search results - page 315 / 1426 » Approximation Algorithms for Treewidth |
145
click to vote
JCO
2010
15 years 3 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
138
Voted
JCSS
2011
14 years 11 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
108
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
We show that linear value-function approximation is equivalent to a form of linear model approximation. We then derive a relationship between the model-approximation error and the...
174
click to vote
IPCO
2008
15 years 6 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
141
Voted
RECOMB
2006
Springer
16 years 5 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...