scientific article; zbMATH DE number 1445322
From MaRDI portal
Publication:4952637
Recommendations
- Geometric red-blue set cover for unit squares and related problems
- Red-blue covering problems and the consecutive ones property
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
- On the minimum degree hypergraph problem with subset size two and the red-blue set cover problem with the consecutive ones property
- Parameterized complexity of \textsc{Red Blue Set Cover} for lines
Cited in
(46)- The labeled maximum matching problem
- Red-blue covering problems and the consecutive ones property
- The labeled perfect matching in bipartite graphs
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
- On the approximability of the minimum rainbow subgraph problem and other related problems
- Logical correctors in the problem of classification by precedents
- On the complexity of rainbow spanning forest problem
- A hybrid metaheuristic for the minimum labeling spanning tree problem
- The rainbow spanning forest problem
- The parameterized complexity of some minimum label problems
- Algorithms and complexity for a class of combinatorial optimization problems with labelling
- On the geometric red-blue set cover problem
- Algorithms and complexity results for labeled correlation clustering problem
- Geometric red-blue set cover for unit squares and related problems
- Finding disjoint paths in networks with star shared risk link groups
- Approximation algorithms and hardness results for labeled connectivity problems
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Parameterized complexity of \textsc{Red Blue Set Cover} for lines
- On the minimum degree hypergraph problem with subset size two and the red-blue set cover problem with the consecutive ones property
- The Red-Blue transportation problem
- Labeled cuts in graphs
- Sequence hypergraphs
- Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
- Approximating Component Selection with General Costs
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property
- How to navigate through obstacles?
- Covering clients with types and budgets
- Comparison of metaheuristics for the k-labeled spanning forest problem
- The computational complexity of and approximation algorithms for variants of the component selection problem
- Frugal Routing on Wireless Ad-Hoc Networks
- A constant-factor approximation algorithm for red-blue set cover with unit disks
- A constant-factor approximation algorithm for red-blue set cover with unit disks
- Exact algorithms and hardness results for geometric red-blue hitting set problem
- Sequence Hypergraphs: Paths, Flows, and Cuts
- Approximation and hardness results for label cut and related problems
- Generalized class cover problem with axis-parallel strips
- Red blue set cover problem on axis-parallel hyperplanes and other objects
- The forget-set identification problem
- On the geometric red-blue set cover problem
- Targeted least cardinality candidate key for relational databases
- Learning weakly convex sets in metric spaces
- Domination and coverage problems under vulnerability constraints
- Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience
- On the hardness of labeled correlation clustering problem: a parameterized complexity view
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
- On the positive-negative partial set cover problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952637)
