A theoretical framework of hybrid approaches to MAX SAT-Reference-Cited by-同舟云学术

A theoretical framework of hybrid approaches to MAX SAT

Published:1997 Issue: Volume: Page:153-162
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Asano Takao,Hori Kuniaki,Ono Takao,Hirata Tomio

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63890-3_18

Reference7 articles.

1. T. Asano, Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. Proc. 5th Israel Symposium on Theory of Computing and Systems, 1997, pp.24–37.

2. T. Asano, T. Ono and T. Hirata, Approximation algorithms for the maximum satisfiability problem. Nordic Journal of Computing, 3 (1996), pp.388–404.

3. T. Asano, K. Hori, T. Ono and T. Hirata, A refinement of Yannakakis's algorithm for MAX SAT. Information Processing Society of Japan, SIGAL-TR-54-11, 1996.

4. U. Feige and M. X. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. Proc. 3rd Israel Symposium on Theory of Computing and Systems, 1995, pp.182–189.

5. M. X. Goemans and D. P. Williamson, New /34-approximation algorithms for the maximum satisfiability problem. SIAM J. Disc. Math., 7 (1994), pp.656–666.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quadratic Optimization in 0-1 Variables;Concepts of Combinatorial Optimization;2014-08-08

2. A survey on combinatorial optimization in dynamic environments;RAIRO - Operations Research;2011-07

3. Improved exact algorithms for MAX-SAT;Discrete Applied Mathematics;2004-08

4. Improved Exact Algorithms for Max-Sat;LATIN 2002: Theoretical Informatics;2002