626 search results - page 26 / 126 » On Approximability of Minimum Bisection Problem |
149
click to vote
OPODIS
2007
15 years 6 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
176
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
148
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
166
click to vote
IPL
2007
15 years 5 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
173
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...