Pages that link to "Item:Q5269825"

The following pages link to Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825):

Displaying 19 items.

• The best \(m\)-term approximation and greedy algorithms (Q1127004) (← links)
• On the greedy algorithm for satisfiability (Q1198012) (← links)
• On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
• Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
• An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
• Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
• A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
• A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
• Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
• CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
• Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
• (Q5090928) (← links)
• On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
• Advice complexity of priority algorithms (Q5916086) (← links)
• Advice complexity of adaptive priority algorithms (Q6180750) (← links)
• Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)
• Optimizing over serial dictatorships (Q6546303) (← links)
• Optimizing over serial dictatorships (Q6635694) (← links)