3875 search results - page 108 / 775 » Approximation algorithms for the 0-extension problem |
108
click to vote
ASPDAC
2010
ACM
15 years 2 months ago
2010
ACM
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
141
click to vote
SIAMCOMP
2002
15 years 4 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
185
click to vote
ICDT
2011
ACM
14 years 8 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
133
click to vote
IPCO
2001
15 years 5 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
139
click to vote
TCS
2010
15 years 2 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...