The following pages link to (Q4952637):
Displaying 39 items.
- Labeled cuts in graphs (Q313962) (← links)
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience (Q742417) (← links)
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems (Q924541) (← links)
- On the positive-negative partial set cover problem (Q975452) (← links)
- The labeled maximum matching problem (Q1000970) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- Logical correctors in the problem of classification by precedents (Q1702653) (← links)
- On the complexity of rainbow spanning forest problem (Q1749772) (← links)
- A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
- The rainbow spanning forest problem (Q1797922) (← 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)
- On the geometric red-blue set cover problem (Q2232240) (← links)
- Algorithms and complexity results for labeled correlation clustering problem (Q2253964) (← links)
- Geometric red-blue set cover for unit squares and related problems (Q2341691) (← links)
- Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Sequence Hypergraphs (Q3181065) (← links)
- Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem (Q3439489) (← links)
- Approximating Component Selection with General Costs (Q3628457) (← links)
- How to Navigate Through Obstacles (Q5002723) (← links)
- (Q5091070) (← links)
- Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
- The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem (Q5384533) (← links)
- Frugal Routing on Wireless Ad-Hoc Networks (Q5459979) (← links)
- A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5918633) (← links)
- Maximum cuts in edge-colored graphs (Q5918845) (← links)
- A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5925710) (← links)
- Sequence Hypergraphs: Paths, Flows, and Cuts (Q6163626) (← links)
- Generalized class cover problem with axis-parallel strips (Q6543343) (← links)
- Red blue set cover problem on axis-parallel hyperplanes and other objects (Q6551707) (← links)
