7129 search results - page 445 / 1426 » Approximation Algorithms for Treewidth |
163
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
176
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
186
click to vote
IRREGULAR
1995
Springer
15 years 10 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
168
click to vote
DAGSTUHL
2007
2007
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms
15 years 7 months ago
We survey on theoretical properties and algorithms concerning the problem of solving a nonsymmetric algebraic Riccati equation, and we report on some known methods and new algorit...
205
click to vote
CIARP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...