The following pages link to (Q3191594):
Displaying 7 items.
- Target set selection for conservative populations (Q2235265) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5918419) (← links)
- Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5925637) (← links)
