Login / Signup
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation.
Bruno Escoffier
Laurent Gourvès
Jérôme Monnot
Olivier Spanjaard
Published in:
Eur. J. Oper. Res. (2010)
Keyphrases
</>
spanning tree
optimization problems
approximation schemes
minimum cost
minimum spanning tree
approximation algorithms
objective function
special case
np complete
combinatorial optimization
run times
minimum spanning trees