The following pages link to (Q5365070):
Displaying 7 items.
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144) (← links)
