scientific article; zbMATH DE number 1522934
From MaRDI portal
Publication:4511230
zbMATH Open0971.68069MaRDI QIDQ4511230FDOQ4511230
Authors: N. Bansal, Venkatesh Raman 
Publication date: 30 October 2001
Title of this publication is not available (Why is that?)
Recommendations
Cited In (40)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- New upper bounds for the problem of maximal satisfiability
- A propositional CONEstrip algorithm
- MAX SAT approximation beyond the limits of polynomial-time approximation
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
- An efficient fixed-parameter algorithm for 3-hitting set
- Title not available (Why is that?)
- A refined branching algorithm for the maximum satisfiability problem
- A new algorithm for parameterized MAX-SAT
- Worst-case study of local search for MAX-\(k\)-SAT.
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT
- Resolution for Max-SAT
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- Improving exact algorithms for MAX-2-SAT
- Title not available (Why is that?)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
- Title not available (Why is that?)
- A logical approach to efficient Max-SAT solving
- Exact algorithms for MAX-SAT
- A new upper bound for Max-2-SAT: A graph-theoretic approach
- MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
- A note on the complexity of minimum dominating set
- Iterative and core-guided maxsat solving: a survey and assessment
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses
- Solving sparse instances of Max SAT via width reduction and greedy restriction
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment
- Solving MaxSAT and \#SAT on structured CNF formulas
- A new algorithm for optimal 2-constraint satisfaction and its implications
- An Empirical Study of MAX-2-SAT Phase Transitions
- Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
- A tighter upper bound for random MAX \(2\)-SAT
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Improved exact algorithms for MAX-SAT
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
- An improved upper bound for SAT
- Upper and lower bounds for different parameterizations of \((n,3)\)-MAXSAT
- Improved exact algorithms for mildly sparse instances of MAX SAT
- New Upper Bounds for Maximum Satisfiability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511230)
