Primal-dual schema based approximation algorithms
From MaRDI portal
Recommendations
- The primal-dual method for approximation algorithms
- Primal-Dual Schema for Capacitated Covering Problems
- Primal-dual schema for capacitated covering problems
- On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
- A primal-dual approximation algorithm for generalized Steiner network problems
Cited in
(7)- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
- Profit maximization problem with coupons in social networks
- Primal-Dual Schema for Capacitated Covering Problems
- On the equivalence between the primal-dual schema and the local-ratio technique
- On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
- Priority-based bin packing with subset constraints
- Primal-dual schema for capacitated covering problems
This page was built for publication: Primal-dual schema based approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736885)