The following pages link to (Q5743407):
Displaying 13 items.
- Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- Orienteering for electioneering (Q2417102) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- (Q5009495) (← links)
- (Q5009502) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
