Pages that link to "Item:Q3115871"
From MaRDI portal
The following pages link to Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems (Q3115871):
Displaying 12 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- The A priori traveling repairman problem (Q722527) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
- Two-stage stochastic max-weight independent set problems (Q2149870) (← links)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- Sampling and Representation Complexity of Revenue Maximization (Q2936993) (← links)
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606) (← links)
- Boosted sampling (Q3580986) (← links)
- Optimal sample cost residues for differential database batch query problems (Q4302830) (← links)
- Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
