7006 search results - page 321 / 1402 » Approximation Algorithms |
134
click to vote
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
143
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
140
click to vote
TNN
1998
15 years 3 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
130
Voted
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
135
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...