Pages that link to "Item:Q6102317"
From MaRDI portal
The following pages link to Approximation algorithms for feasible cut and multicut problems (Q6102317):
Displaying 17 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Rounding to an integral program (Q943791) (← links)
- Approximating \(\alpha\)-cuts with the vertex method (Q1311912) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Approximation algorithms for minimum \(K\)-cut (Q1977137) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Rounding algorithms for a geometric embedding of minimum multiway cut (Q2819596) (← links)
- Towards Algorithmic Cut-Introduction (Q2891453) (← links)
- Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
- (Q4607980) (← links)
- Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings (Q5368723) (← links)
- Efficient Algorithms for the Label Cut Problems (Q5410648) (← links)
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts (Q5418982) (← links)
- Approximation and Online Algorithms (Q5713449) (← links)
