534 search results - page 55 / 107 » Tight approximation algorithm for connectivity augmentation ... |
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...
PVLDB
2008
13 years 7 months ago
2008
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...