The following pages link to (Q4828974):
Displaying 10 items.
- Solution of the propeller conjecture in \(\mathbb R^3\) (Q368772) (← links)
- Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- Bipartite multigraphs with expander-like properties (Q2381530) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- (Q4251070) (← links)
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems (Q4537628) (← links)
- Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- (Q5433687) (← links)
