Pages that link to "Item:Q2467439"
From MaRDI portal
The following pages link to A simpler and better derandomization of an approximation algorithm for single source rent-or-buy (Q2467439):
Displaying 11 items.
- Deterministic sampling algorithms for network design (Q547282) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
- Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
- Designing Cost-Sharing Methods for Bayesian Games (Q2819469) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem (Q5505665) (← links)
