Pages that link to "Item:Q1959420"
From MaRDI portal
The following pages link to The parameterized complexity of some minimum label problems (Q1959420):
Displayed 18 items.
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- Generalized rainbow connectivity of graphs (Q744052) (← 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)
- Colored cut games (Q2087453) (← 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)
- Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
- Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
- Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs (Q3297773) (← links)
- (Q5009492) (← links)
- Maximum cuts in edge-colored graphs (Q5918845) (← links)