Author:
Feige Uriel,Jozeph Shlomo
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference25 articles.
1. Alimonti, P.: New local search approximation techniques for maximum generalized satisfiability problems. Inf. Process. Lett. 57(3), 151–158 (1996)
2. Alimonti, P.: Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT. In: Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 2–14 (1997)
3. Alon, N., Bollobás, B., Gyárfás, A., Lehel, J., Scott, A.: Maximum directed cuts in acyclic digraphs. J. Graph Theory 55(1), 1–13 (2007)
4. Athanassopoulos, S., Caragiannis, I., Kaklamanis, C.: Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. Theory Comput. Syst. 45(3), 555–576 (2009)
5. Austrin, P.: Conditional Inapproximability and Limited Independence. Ph.D. thesis, KTH—Royal Institute of Technology, Sweden (2008)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献