630 search results - page 50 / 126 » Hardness results for approximating the bandwidth |
356
click to vote
AAIM
2011
Springer
14 years 9 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
210
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
165
click to vote
ISCAS
1999
IEEE
15 years 10 months ago
1999
IEEE
Recently a method in FIR filter design using cosine modulation was proposed. Given a prototype M-th band lowpass filter with cutoff frequency at M , one can obtain a new filter wi...
169
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
148
click to vote
JAL
2007
15 years 6 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...