4843 search results - page 127 / 969 » The Shortcut Problem - Complexity and Approximation |
78
Voted
ADCM
2007
14 years 10 months ago
2007
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
APPML
2008
14 years 10 months ago
2008
The present work is concerned with the uniqueness problem of best simultaneous approximation. An n-dimensional l1- or l-simultaneous unicity space is characterized in terms of Pro...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
61
Voted
JAT
2007
14 years 10 months ago
2007
We prove sharp bounds for the expectation of the supremum of the Gaussian process indexed by the intersection of Bn p with ρBn q for 1 ≤ p, q ≤ ∞ and ρ > 0, and by the ...
103
Voted
COLOGNETWENTE
2010
14 years 8 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...