3049 search results - page 60 / 610 » On the Convergence of Bound Optimization Algorithms |
131
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
122
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
134
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
157
click to vote
IPCO
2010
15 years 2 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
112
click to vote
AMC
2005
15 years 4 months ago
2005
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...