Pages that link to "Item:Q630189"
From MaRDI portal
The following pages link to Approximation and hardness results for label cut and related problems (Q630189):
Displaying 11 items.
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- Refined parameterizations for computing colored cuts in edge-colored graphs (Q2082563) (← links)
- Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Algorithms and complexity results for labeled correlation clustering problem (Q2253964) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
- Sequence Hypergraphs (Q3181065) (← links)
