The following pages link to (Q4737227):
Displayed 4 items.
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)