CORR
2010
Springer
13 years 4 months ago
2010
Springer
In the k-edge-connected spanning subgraph problem we are given a graph (V, E) and costs for each edge, and want to find a minimum-cost F E such that (V, F) is k-edge-connected. I...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...