The following pages link to Mathias Hauptmann (Q385959):
Displayed 7 items.
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- On the approximability of dense Steiner problems (Q396661) (← links)
- Approximation complexity of metric dimension problem (Q450564) (← links)
- Inapproximability of dominating set on power law graphs (Q476891) (← links)
- On Approximation Complexity of Metric Dimension Problem (Q3000502) (← links)
- (Q5480276) (← links)
- Randomized Approximation Schemes for the Tutte Polynomial and Random Clustering in Subdense and Superdense Graphs (Q6409170) (← links)