Publisher
Springer International Publishing
Reference10 articles.
1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1), 123–134 (2000).
https://doi.org/10.1016/S0304-3975(98)00158-3
2. Dinur, I., Safra, S.: On the hardness of approximating vertex cover. Ann. Math. 162(1), 439–485 (2005).
https://doi.org/10.4007/annals.2005.162.439
3. Evans, W., Gethner, E., Spalding-Jamieson, J., Wolff, A.: Angle covers: algorithms and complexity. Arxiv (2019).
http://arxiv.org/abs/1911.02040
4. Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691–703 (1976).
https://doi.org/10.1137/0205048
5. Haas, R., et al.: Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31(1), 31–61 (2005)