Pages that link to "Item:Q1351157"

The following pages link to On approximation algorithms for the minimum satisfiability problem (Q1351157):

Displaying 35 items.

• Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
• Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
• On the minimum satisfiability problem (Q779212) (← links)
• Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
• On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing (Q878685) (← links)
• On the minimum hitting set of bundles problem (Q1035686) (← links)
• The labeled perfect matching in bipartite graphs (Q1044711) (← links)
• A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
• On the greedy algorithm for satisfiability (Q1198012) (← links)
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
• Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
• Sparsification and subexponential approximation (Q1702300) (← links)
• Optimizing with minimum satisfiability (Q1761303) (← links)
• Approximating MIN 2-SAT and MIN 3-SAT (Q1780843) (← links)
• Approximation bounds for the minimum \(k\)-storage problem (Q1796432) (← links)
• Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
• On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
• Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
• Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
• (In)approximability of maximum minimal FVS (Q2051849) (← links)
• Set-weighted games and their application to the cover problem (Q2083971) (← links)
• A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
• A non-clausal tableau calculus for \textsc{MinSat} (Q2234795) (← links)
• On subexponential and FPT-time inapproximability (Q2343081) (← links)
• Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
• (Q2762521) (← links)
• Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
• On the Minimum Hitting Set of Bundles Problem (Q3511409) (← links)
• Fixed-parameter Approximability of Boolean MinCSPs (Q4606287) (← links)
• Approximation Algorithms for CSPs (Q4993604) (← links)
• ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM (Q5151087) (← links)
• Mathematical Foundations of Computer Science 2004 (Q5311102) (← links)
• Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)
• On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)