1
Assuntos:
“...Inapproximability threshold...”
The k-hop connected dominating set problem: approximation algorithms and hardness results
Tese