Pages that link to "Item:Q2457298"
From MaRDI portal
The following pages link to Cut problems in graphs with a budget constraint (Q2457298):
Displaying 4 items.
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- Unbalanced graph partitioning (Q372961) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- The bi-objective critical node detection problem (Q1681144) (← links)
