Sciweavers

CORR
2010
Springer
57views Education» more  CORR 2010»
14 years 1 days ago
k-Edge-Connectivity: Approximation and LP Relaxation
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...
David Pritchard
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
14 years 7 months ago
Multiplicative approximations and the hypervolume indicator
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...
Tobias Friedrich, Christian Horoba, Frank Neumann