4277 search results - page 305 / 856 » On Multiple Linear Approximations |
SODA
2008
ACM
15 years 22 days ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
SIAMCOMP
2008
14 years 11 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
DATE
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper presents an efficient approach to compute the dominant poles for the reduced-order admittance (Y parameter) matrix of lossy interconnects. Using the global approximati...
HLK
2003
IEEE
15 years 4 months ago
2003
IEEE
In some applications objects are known to have nonsmooth or “jagged” edges, which are not well approximated by smooth curves. We use subdivision curves as a simple but flexib...
128
click to vote
FOGA
2011
14 years 2 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...