Pages that link to "Item:Q896125"
From MaRDI portal
The following pages link to Improved parameterized and exact algorithms for cut problems on trees (Q896125):
Displaying 11 items.
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211) (← links)
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition (Q2285134) (← links)
- An improved parameterized algorithm for the minimum node multiway cut problem (Q2391180) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
- Fixed-parameter tractability and data reduction for multicut in trees (Q3367053) (← links)
- FPTAS’s for Some Cut Problems in Weighted Trees (Q3587352) (← links)
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees (Q3740255) (← links)