Pages that link to "Item:Q5716852"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716852):
Displaying 7 items.
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Commitment under uncertainty: Two-stage stochastic matching problems (Q959814) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)
