Old Web
Aproximación De Problemas Combinatorios Con Optimización Semidefinida Y Redondeo Aleatorio
2016
We apply an algorithm designed with semidefinite optimization techniques and random rounding to approximate polynomial time problems of class NP -Hard .
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI