1469 search results - page 156 / 294 » Approximate polynomial decomposition |
138
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
130
click to vote
STOC
2010
ACM
16 years 2 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
142
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
130
click to vote
STOC
1998
ACM
15 years 9 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
170
click to vote
UAI
2008
15 years 6 months ago
2008
Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinfor...