Pages that link to "Item:Q5311102"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311102):
Displaying 7 items.
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Approximation algorithm for minimum \(q\)-dominator partization problem (Q6542935) (← links)