Pages that link to "Item:Q924541"
From MaRDI portal
The following pages link to Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems (Q924541):
Displaying 15 items.
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
- Improved approximation algorithms for projection games (Q513283) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- On the positive-negative partial set cover problem (Q975452) (← 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)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- Approximating Component Selection with General Costs (Q3628457) (← links)
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic <i>k</i> -Spanner (Q4962219) (← links)
- The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem (Q5384533) (← links)
- On the maximum edge-pair embedding bipartite matching (Q5918365) (← links)
- Red blue set cover problem on axis-parallel hyperplanes and other objects (Q6551707) (← links)
