The following pages link to Claus Viehmann (Q450530):
Displaying 7 items.
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Approximation complexity of metric dimension problem (Q450564) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Approximating Subdense Instances of Covering Problems (Q2840726) (← links)
- On Approximation Complexity of Metric Dimension Problem (Q3000502) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
