Upper Bounds for MaxSat: Further Improved
The MAXSAT problem, which asks for an assignment satisfying the maximum number of clauses of F, can be solved in O(1:341294m|F|) time.
The parameterized version of the problem, that is determining whether there exists an assignment satisfying at least k clauses of the formula (for some integer k), can be solved in O(k 21:380278k + |F|) time.
MAXSAT can be solved in O(1:105729|F||F|) time.
KeywordsVertex Cover Conjunctive Normal Form Reduction Rule Parameterized Case Unit Clause
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 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.Google Scholar
- 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. Petersburg, 1998.Google Scholar
- 5.R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, November 1998.Google Scholar
- 6.E.A. Hirsch, ‘Two new upper bounds for SAT’, Proc. of 9th Symposium on Discrete Algorithms, (1998) 521–530.Google Scholar
- 7.O. Kullmann, ‘Worst-case analysis, 3-SAT decision and lower bounds: approaches for improved SAT algorithms`, DIMACS Proc. SAT Workshop 1996, AMS, 1996.Google Scholar
- 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.Google Scholar
- 9.B. Monien, E. Speckenmeyer, ‘Solving Satisfiability in less than 2n steps’, Discrete Applied Mathematics, 10 (1985) 287–295.Google Scholar
- 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).Google Scholar
- 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).Google Scholar
- 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).Google Scholar
- 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.Google Scholar
- 14.V. Raman, B. Ravikumar and S. Srinivasa Rao, ‘A Simplified NP-Complete MA-XSAT problem’ Information Processing Letters, 65, (1998) 1–6.Google Scholar
- 15.J. M. Robson, ‘Algorithms for the Maximum Independent Sets’. Journal of Algorithms 7, (1986) 425–440.Google Scholar
- 16.I. Schiermeyer, ‘Solving 3-Satisfiability in less than 1:579n steps’, Lecture Notes in Computer Science, Springer Verlag 702, (1993) 379–394.Google Scholar