Pages that link to "Item:Q3448785"
From MaRDI portal
The following pages link to Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785):
Displaying 12 items.
- Socially fair network design via iterative rounding (Q2084030) (← links)
- Efficient solution and computation of models with occasionally binding constraints (Q2098018) (← links)
- Practically uniform solution sampling in constraint programming (Q2170209) (← links)
- Democratic fair allocation of indivisible goods (Q2289012) (← links)
- The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) (← links)
- Approximate Constraint Satisfaction Requires Large LP Relaxations (Q3177811) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- (Q3493317) (← links)
- (Q4250183) (← links)
- Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication (Q4638074) (← links)
- Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
- Sign rank vs discrepancy (Q5092468) (← links)