Pages that link to "Item:Q3128195"
From MaRDI portal
The following pages link to Approximation Algorithms for Steiner and Directed Multicuts (Q3128195):
Displayed 13 items.
- Extended cuts (Q266025) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- An improved approximation algorithm for requirement cut (Q991474) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
- Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)