Pages that link to "Item:Q1029090"
From MaRDI portal
The following pages link to On the hardness of approximating label-cover (Q1029090):
Displaying 14 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← 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)
- A note on the subadditive network design problem (Q1038103) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Target set selection for conservative populations (Q2235265) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- On the hardness of approximating the min-hack problem (Q2569170) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
- Frugal Routing on Wireless Ad-Hoc Networks (Q5459979) (← links)
- On the maximum edge-pair embedding bipartite matching (Q5918365) (← links)
