4843 search results - page 78 / 969 » The Shortcut Problem - Complexity and Approximation |
CIE
2005
Springer
14 years 12 months ago
2005
Springer
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
JCO
2008
14 years 10 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...