626 search results - page 53 / 126 » On Approximability of Minimum Bisection Problem |
CIAC
2000
Springer
14 years 2 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
CIAC
2006
Springer
14 years 1 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
INFOCOM
2005
IEEE
14 years 3 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...