Pages that link to "Item:Q630189"

The following pages link to Approximation and hardness results for label cut and related problems (Q630189):

Displaying 22 items.

• Labeled cuts in graphs (Q313962) (← links)
• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
• The maximum labeled path problem (Q527429) (← 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)
• The parameterized complexity of some minimum label problems (Q1959420) (← 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)
• Maximum reachability preserved graph cut (Q2202008) (← 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)
• Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
• Sequence Hypergraphs (Q3181065) (← links)
• Efficient Algorithms for the Label Cut Problems (Q5410648) (← links)
• Approximation Algorithms and Hardness Results for Labeled Connectivity Problems (Q5756701) (← links)
• The Parameterized Complexity of Some Minimum Label Problems (Q5851096) (← links)
• Maximum cuts in edge-colored graphs (Q5918845) (← links)
• Sequence Hypergraphs: Paths, Flows, and Cuts (Q6163626) (← links)