Pages that link to "Item:Q5875476"

The following pages link to Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476):

Displaying 4 items.

• Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
• Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
• Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
• Matroid-constrained vertex cover (Q6162073) (← links)