Author:
Nguyen Cam Ly,Suppakitpaisarn Vorapong,Surarerks Athasit,Vajanopath Phanu
Publisher
Springer International Publishing
Reference15 articles.
1. Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54(2), 317–331 (1997)
2. Biswas, P., Lian, T.C., Wang, T.C., Ye, Y.: Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sens. Netw. (TOSN) 2(2), 188–220 (2006)
3. Charikar, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for label cover problems. ESA 2009, 23–34 (2009)
4. Fleischner, H.: X. 1 algorithms for Eulerian trails. In: Eulerian Graphs and Related Topics: Part 1. Annals of Discrete Mathematics, vol. 50, pp. 1–13 (1991)
5. Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3-and 4-regular Hamiltonian graphs. Discrete Math. 310(20), 2742–2749 (2010)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献