Pages that link to "Item:Q3448816"
From MaRDI portal
The following pages link to Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816):
Displaying 6 items.
- A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- A modeling and computational study of the frustration index in signed networks (Q6068535) (← links)
