Author:
Canzar Stefan,Elbassioni Khaled,Klau Gunnar W.,Mestre Julián
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference17 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. Bar-Yehuda, R., Halldórsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput. 36(1), 1–15 (2006)
3. Berman, P., Karpinski, M.: On some tighter inapproximability results. In: Proc. of the 26th International Colloquium on Automata, Languages and Programming, pp. 200–209 (1999)
4. Canzar, S., Elbassioni, K., Klau, G.W., Mestre, J.: On tree-constrained matchings and generalizations. In: Proc. of the 38th International Colloquium on Automata, Languages and Programming, pp. 98–109 (2011)
5. Feige, U., Lovász, L.: Two-prover one-round proof systems: their power and their problems. In: Proc. of the 24th Annual ACM Symposium on Theory of Computing, pp. 733–744 (1992)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献