The following pages link to Approximation via cost sharing (Q3546337):
Displaying 19 items.
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Competitive cost sharing with economies of scale (Q547291) (← links)
- Dynamic vs. oblivious routing in network design (Q634684) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Towards flexible demands in online leasing problems (Q1750358) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
- Two-stage stochastic max-weight independent set problems (Q2149870) (← links)
- Group parking permit problems (Q2184679) (← links)
- A simpler and better derandomization of an approximation algorithm for single source rent-or-buy (Q2467439) (← links)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
- Minimum-Cost Network Design with (Dis)economies of Scale (Q3464060) (← links)
- Multi-Priority Online Scheduling with Cancellations (Q4969311) (← links)
- Exploring the Tractability of the Capped Hose Model (Q5111705) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- Competitive Cost Sharing with Economies of Scale (Q5458541) (← links)
