523 search results - page 34 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
WDAG
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
IJCAI
2007
13 years 9 months ago
2007
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
IM
2007
13 years 7 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...