Pages that link to "Item:Q2851865"

The following pages link to A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs (Q2851865):

Displaying 10 items.

• Quick approximation to matrices and applications (Q1125616) (← links)
• An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
• A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs (Q2851865) (← links)
• (Q2941636) (redirect page) (← links)
• Approximating sparsest cut in low rank graphs via embeddings from approximately low-dimensional spaces (Q5002624) (← links)
• A fast new algorithm for weak graph regularity (Q5222555) (← links)
• Multi-way spectral partitioning and higher-order cheeger inequalities (Q5415539) (← links)
• Spectral graph theory via higher order eigenvalues and applications to the analysis of random walks (Q5963354) (← links)
• A unified view of graph regularity via matrix decompositions (Q6074704) (← links)
• Regular decomposition of the edge set of a graph with applications (Q6562433) (← links)