Pages that link to "Item:Q4377436"

The following pages link to Computing All Small Cuts in an Undirected Network (Q4377436):

Displaying 18 items.

• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← links)
• A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163) (← links)
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
• Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
• Connectivity interdiction (Q1785279) (← links)
• Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
• Unbalanced graph cuts with minimum capacity (Q2515430) (← links)
• Improving on best-of-many-Christofides for \(T\)-tours (Q2661569) (← links)
• Efficient Algorithms for the k Smallest Cuts Enumeration (Q3511355) (← links)
• Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
• A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
• (Q5111689) (← links)
• Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
• Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
• On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
• Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions (Q6586662) (← links)
• Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)