Pages that link to "Item:Q3376662"

The following pages link to On the random 2-stage minimum spanning tree (Q3376662):

Displaying 8 items.

• On the approximability of robust spanning tree problems (Q620950) (← links)
• The submodularity of two-stage stochastic maximum-weight independent set problems (Q2089673) (← links)
• Typical values of extremal-weight combinatorial structures with independent symmetric weights (Q2111788) (← links)
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
• Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (Q2270290) (← links)
• Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
• On greedy approximation algorithms for a class of two-stage stochastic assignment problems (Q5746684) (← links)
• Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms (Q6087397) (← links)