Pages that link to "Item:Q5716852"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716852):
Displaying 12 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)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Network design for information networks (Q2921761) (← links)
- Analysis of Steiner subtrees of random trees for traceroute algorithms (Q3055772) (← links)
- Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
- LP Rounding Approximation Algorithms for Stochastic Network Design (Q5388034) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)
