Pages that link to "Item:Q3092215"
From MaRDI portal
The following pages link to Bounds on Greedy Algorithms for MAX SAT (Q3092215):
Displaying 14 items.
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Limitations of incremental dynamic programming (Q517805) (← 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)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← 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)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← 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)
- 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)