scientific article; zbMATH DE number 1522934
From MaRDI portal
Publication:4511230
zbMath0971.68069MaRDI QIDQ4511230
Nikhil Bansal, Venkatesh Raman
Publication date: 30 October 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Improved exact algorithms for MAX-SAT, A logical approach to efficient Max-SAT solving, Improved exact algorithms for mildly sparse instances of MAX SAT, An efficient fixed-parameter algorithm for 3-hitting set, Boosting branch-and-bound MaxSAT solvers with clause learning, Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms, A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between, A tighter upper bound for random MAX \(2\)-SAT, Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT., Worst-case study of local search for MAX-\(k\)-SAT., Solving sparse instances of Max SAT via width reduction and greedy restriction, Breaking Cycle Structure to Improve Lower Bound for Max-SAT, A note on the complexity of minimum dominating set, A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP, Dealing with 4-variables by resolution: an improved MaxSAT algorithm, Exact Algorithms for MAX-SAT, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, MAX SAT approximation beyond the limits of polynomial-time approximation, Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment, A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem, An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses, A Propositional CONEstrip Algorithm, Resolution for Max-SAT, A new algorithm for optimal 2-constraint satisfaction and its implications, An Empirical Study of MAX-2-SAT Phase Transitions, Iterative and core-guided maxsat solving: a survey and assessment, Improving exact algorithms for MAX-2-SAT, A refined branching algorithm for the maximum satisfiability problem
