Sciweavers

365 search results - page 37 / 73
» On the Crossing Spanning Tree Problem
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 3 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
DISOPT
2010
132views more  DISOPT 2010»
13 years 9 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
JDA
2007
97views more  JDA 2007»
13 years 9 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
IPPS
2010
IEEE
13 years 7 months ago
Parallel external memory graph algorithms
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
Lars Arge, Michael T. Goodrich, Nodari Sitchinava
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 9 months ago
The Impact of Topology on Byzantine Containment in Stabilization
Self-stabilization is an versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of ...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...