7930 search results - page 426 / 1586 » Greedy in Approximation Algorithms |
182
click to vote
JCSS
2011
15 years 1 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...
173
click to vote
WICON
2008
15 years 8 months ago
2008
Many efforts have been devoted to maximizing the network throughput with limited channel resources in multi-radio multi-channel wireless mesh networks. It has been believed that t...
141
click to vote
ICML
2008
IEEE
16 years 7 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...
218
click to vote
IPCO
2008
15 years 8 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...
178
click to vote
RECOMB
2006
Springer
16 years 7 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...