4843 search results - page 343 / 969 » The Shortcut Problem - Complexity and Approximation |
127
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
133
click to vote
TCS
2008
15 years 4 months ago
2008
We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...
174
click to vote
NA
2010
15 years 2 months ago
2010
In the field of spectral element approximations, the interpolation points can be chosen on the basis of different criteria, going from the minimization of the Lebesgue constant to ...
112
click to vote
SLP
1997
15 years 5 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
160
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...