Upper bounds for maxsat: Further improved?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1741, Issue , 1999, Pages 247-258

  Bansal, Nikhil ^a   Raman, Venkatesh ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOOLEAN CNF FORMULAS; MAX-SAT; MAX-SAT PROBLEMS; PARAMETERIZED; SATISFIABILITY PROBLEMS; UPPER BOUND;

BOOLEAN ALGEBRA;

EID: 84958045373     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_26     Document Type: Conference Paper

References (16)

1. R. Balasubramanian, M. R. Fellows and V. Raman, ‘An Improved fixed parameter algorithm for vertex cover' Information Processing Letters, 65 (3):163-168, 1998.
2. N. Bansal and V. Raman, ‘Upper Bounds for MaxSat: Further Improved', Technical Report of the Institute of Mathematical Sciences, IMSc preprint 99/08/30.
3. R. Beigel and D. Eppstein, ‘3-coloring in time O(1:3446n): A no-MIS Algorithm', In Proc of IEEE Foundations of Computer Science (1995) 444-452.
4. E. Dantsin, M. R. Gavrilovich, E. A. Hirsch and B. Konev, ‘Approximation algorithms for MAX SAT: a better performance ratio at the cost of a longer running time', PDMI preprint 14/1998, Stekolov Institute of Mathematics at St. Peters-burg, 1998.
5. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, November 1998.
6. E.A. Hirsch, ‘Two new upper bounds for SAT', Proc. of 9th Symposium on Discrete Algorithms, (1998) 521-530.
7. O. Kullmann, ‘Worst-case analysis, 3-SAT decision and lower bounds: approaches for improved SAT algorithms’, DIMACS Proc. SAT Workshop 1996, AMS, 1996.
8. M. Mahajan and V. Raman, ‘Parameterizing above guaranteed values: MaxSat and MaxCut'. Technical Report TR97-033, ECCC Trier, 1997. To appear in Journal of Algorithms.
9. n steps', Discrete Applied Mathematics, 10 (1985) 287-295.
10. R. Niedermeier and P. Rossmanith, ‘Upper bounds for Vertex Cover: Further Improved'. in Symposum on Thoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, Springer Verlag. March (1999).
11. R. Niedermeier and P. Rossmanith, ‘New Upper Bounds for MAXSAT', International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, Springer Verlag (1999).
12. R. Paturi, P. Pudlak, M. Saks, and F. Zane. ‘An improved exponential-time algorithm for k-SAT', In Proc. of 39th IEEE Foundations of Computer Science (1998).
13. P. Pudlak, ‘Satisfiability-algorithms and logic', In Proc. of 23rd Conference on Mathematical Foundations of Computer Science, 1450 in Lecture Notes in Computer Science Springer Verlag, August (1998) 129-141.
14. V. Raman, B. Ravikumar and S. Srinivasa Rao, ‘A Simplified NP-Complete MA-XSAT problem' Information Processing Letters, 65, (1998) 1-6.
15. J. M. Robson, ‘Algorithms for the Maximum Independent Sets'. Journal of Algorithms 7, (1986) 425-440.
16. I. Schiermeyer, ‘Solving 3-Satisfiability in less than 1:579n steps', Lecture Notes in Computer Science, Springer Verlag 702, (1993) 379-394.