534 search results - page 43 / 107 » Tight approximation algorithm for connectivity augmentation ... |
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We prove that every n-point metric space of negative type (and, in particular, every npoint subset of L1) embeds into a Euclidean space with distortion O( log n ? log log n), a r...
PEPM
1995
ACM
13 years 11 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
TALG
2010
13 years 6 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
JCO
2006
13 years 7 months ago
2006
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...