Pages that link to "Item:Q2944490"

The following pages link to On network design problems: fixed cost flows and the covering steiner problem (Q2944490):

Displaying 13 items.

• On fixed cost \(k\)-flow problems (Q260248) (← links)
• The minimum vulnerability problem on specific graph classes (Q346526) (← links)
• Finding paths with minimum shared edges (Q386426) (← links)
• The minimum vulnerability problem (Q487032) (← links)
• Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
• Improved approximation algorithms for label cover problems (Q634686) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598) (← links)
• The minimum degree group Steiner problem (Q2065790) (← links)
• Approximability of capacitated network design (Q2354026) (← links)
• The Minimum Vulnerability Problem on Graphs (Q2942407) (← links)
• Network flow spanners (Q3057178) (← links)
• Resource allocation by means of project networks: Dominance results (Q3113507) (← links)