Pages that link to "Item:Q3579226"
From MaRDI portal
The following pages link to Random sampling and approximation of MAX-CSP problems (Q3579226):
Displaying 10 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- Note on upper density of quasi-random hypergraphs (Q396781) (← links)
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing (Q952421) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Random sampling and approximation of MAX-CSPs (Q1886453) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
- On random sampling in uniform hypergraphs (Q5198663) (← links)
- Testing subgraphs in directed graphs (Q5917574) (← links)
