Pages that link to "Item:Q3367053"
From MaRDI portal
The following pages link to Fixed-parameter tractability and data reduction for multicut in trees (Q3367053):
Displaying 15 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Query-competitive algorithms for cheapest set problems under uncertainty (Q899309) (← links)
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- A logical approach to multicut problems (Q2379958) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Multicut Is FPT (Q4605273) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
