The following pages link to (Q2934722):
Displaying 11 items.
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Competitive cost sharing with economies of scale (Q547291) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- Oblivious Buy-at-Bulk in Planar Graphs (Q3078378) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- Competitive Cost Sharing with Economies of Scale (Q5458541) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)