Author:
Escoffier Bruno,Paschos Vangelis Th.,Tourniaire Emeric
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. In: Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin (1999)
2. Lecture Notes in Computer Science;A. Avidor,2006
3. Battiti, R., Protasi, M.: Algorithms and heuristics for max-sat. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 1, pp. 77–148. Kluwer Academic Publishers (1998)
4. Björklund, A.: Determinant sums for undirected Hamiltonicity. In: Proc. FOCS 2010, pp. 173–182. IEEE Computer Society (2010)
5. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546–563 (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献