Sciweavers

OPODIS
2007
14 years 27 days ago
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
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 ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
14 years 5 months ago
SNDL-MOEA: stored non-domination level MOEA
There exist a number of high-performance Multi-Objective Evolutionary Algorithms (MOEAs) for solving MultiObjective Optimization (MOO) problems; two of the best are NSGA-II and -M...
Matt D. Johnson, Daniel R. Tauritz, Ralph W. Wilke...