Pages that link to "Item:Q834942"
From MaRDI portal
The following pages link to Simplified tight analysis of Johnson's algorithm (Q834942):
Displaying 3 items.
- Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)