1
Assuntos:
“...Inapproximability...”
The k-labeled spanning forest problem : complexity, approximability, formulations and algorithms
Dissertação
2
Assuntos:
“...inapproximability...”
Recoloração convexa de grafos: algoritmos e poliedros
Dissertação
3
Assuntos:
“...Inapproximability threshold...”
The k-hop connected dominating set problem: approximation algorithms and hardness results
Tese