Pages that link to "Item:Q2457298"
From MaRDI portal
The following pages link to Cut problems in graphs with a budget constraint (Q2457298):
Displaying 12 items.
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- Unbalanced graph partitioning (Q372961) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Multistage graph problems on a global budget (Q831134) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- The bi-objective critical node detection problem (Q1681144) (← links)
- Strategic multiway cut and multicut games (Q1946494) (← links)
- Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models (Q2136875) (← links)
- On the linear relaxation of the \(s-t\)-cut problem with budget constraints (Q2225051) (← links)
- Approximability of the firefighter problem. Computing cuts over time (Q2428668) (← links)
- On efficient vaccine distribution strategy to suppress pandemic using social relation (Q2798324) (← links)
- Bounded size graph clustering with applications to stream processing (Q2920135) (← links)
