4843 search results - page 351 / 969 » The Shortcut Problem - Complexity and Approximation |
151
click to vote
IPL
2007
15 years 4 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
146
click to vote
MOC
2000
15 years 4 months ago
2000
In this paper we construct elliptic boundary value problems whose standard finite element approximations converge arbitrarily slowly in the energy norm, and show that adaptive proc...
136
click to vote
SIAMJO
2008
15 years 2 months ago
2008
A class of trust-region algorithms is developed and analyzed for the solution of minimization problems with nonlinear inequality constraints. Based on composite-step trust region ...
163
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
132
click to vote
WIA
2007
Springer
15 years 10 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...