Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991)
2. Lecture Notes in Computer Science;A. Aszami,2007
3. Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes and systems of linear equations. J. Comput. System Sci. 54, 317–331 (1997)
4. Berman, P., Karpinski, M.: Improved Approximation Lower Bounds on Small Occurrence Optimization. Electronic Colloquium on Computational Complexity, TR Report 03-008 (2003)
5. Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-Closure Spanners. In: SODA 2009, pp. 531–540 (2009)