Pages that link to "Item:Q5900948"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900948):
Displayed 11 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Average-case analysis for the MAX-2SAT problem (Q964385) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- An exact algorithm for MAX-CUT in sparse graphs (Q2467485) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
- A Spectral Method for MAX2SAT in the Planted Solution Model (Q5387750) (← links)