Pages that link to "Item:Q2426652"

The following pages link to Approximation algorithms and hardness results for labeled connectivity problems (Q2426652):

Displaying 26 items.

• Labeled cuts in graphs (Q313962) (← links)
• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
• A note on the clustered set covering problem (Q496643) (← links)
• Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
• The maximum labeled path problem (Q527429) (← links)
• Approximation and hardness results for label cut and related problems (Q630189) (← 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)
• Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
• The parameterized complexity of some minimum label problems (Q1959420) (← links)
• Complexity and approximation results on the shared transportation problem (Q2149862) (← links)
• Improved approximation bounds for the minimum constraint removal problem (Q2206735) (← links)
• Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
• Algorithms and complexity results for labeled correlation clustering problem (Q2253964) (← links)
• Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
• Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
• Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
• Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
• Complexity of column generation in network design with path-based survivability mechanisms (Q2892152) (← links)
• Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
• Sequence Hypergraphs (Q3181065) (← links)
• (Q5009492) (← links)
• The complexity of bottleneck labeled graph problems (Q5961969) (← links)
• On the shared transportation problem: computational hardness and exact approach (Q6610092) (← links)