Pages that link to "Item:Q2457298"

The following pages link to Cut problems in graphs with a budget constraint (Q2457298):

Displayed 7 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)
• Strategic multiway cut and multicut games (Q1946494) ‎ (← 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)