626 search results - page 54 / 126 » On Approximability of Minimum Bisection Problem |
MOBIQUITOUS
2007
IEEE
14 years 4 months ago
2007
IEEE
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
FOCS
2000
IEEE
14 years 2 months ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
ALGORITHMICA
2006
13 years 9 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...