The following pages link to Shayan Oveis Gharan (Q247111):
Displayed 46 items.
- On variants of the matroid secretary problem (Q2017872) (← links)
- A generalization of permanent inequalities and applications in counting and optimization (Q2020379) (← links)
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids (Q2059021) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← links)
- A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (Q2843285) (← links)
- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs (Q2851865) (← links)
- Online Stochastic Matching: Online Actions Based on Offline Statistics (Q2925346) (← links)
- Almost Optimal Local Graph Clustering Using Evolving Sets (Q3177772) (← links)
- Approximation Algorithms for Finding Maximum Induced Expanders (Q4575817) (← links)
- Approximating the Largest Root and Applications to Interlacing Families (Q4607949) (← links)
- Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities (Q4608042) (← links)
- A generalization of permanent inequalities and applications in counting and optimization (Q4977987) (← links)
- Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model (Q5009783) (← links)
- On the Bias of Reed--Muller Codes over Odd Prime Fields (Q5112827) (← links)
- An improved approximation algorithm for TSP in the half integral case (Q5144894) (← links)
- Composable Core-sets for Determinant Maximization Problems via Spectral Spanners (Q5146881) (← links)
- Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid (Q5212742) (← links)
- A simply exponential upper bound on the maximum number of stable matchings (Q5230350) (← links)
- An <i>O</i>(log <i>n</i>/log log <i>n</i>)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem (Q5360842) (← links)
- (Q5365094) (← links)
- (Q5365102) (← links)
- Partitioning into Expanders (Q5384055) (← links)
- Multi-way spectral partitioning and higher-order cheeger inequalities (Q5415539) (← links)
- (Q5417632) (← links)
- A Randomized Rounding Approach to the Traveling Salesman Problem (Q5494986) (← links)
- Improved Cheeger's inequality (Q5495771) (← links)
- Spectral graph theory via higher order eigenvalues and applications to the analysis of random walks (Q5963354) (← links)
- A (slightly) improved approximation algorithm for metric TSP (Q6065169) (← links)
- An improved approximation algorithm for the minimum <i>k</i> -edge connected multi-subgraph problem (Q6083616) (← links)
- A deterministic better-than-3/2 approximation algorithm for metric TSP (Q6086006) (← links)
- Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests (Q6087012) (← links)
- (Q6126295) (← links)
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid (Q6181233) (← links)
- A Universal upper bound on Graph Diameter based on Laplacian Eigenvalues (Q6237951) (← links)
- The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP (Q6256933) (← links)
- Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes (Q6270555) (← links)
- Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices (Q6285403) (← links)
- Log-Concave Polynomials I: Entropy and a Deterministic Approximation Algorithm for Counting Bases of Matroids (Q6303787) (← links)
- Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids (Q6309211) (← links)
- An Improved Approximation Algorithm for TSP in the Half Integral Case (Q6323008) (← links)
- A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP (Q6368165) (← links)
- A Matrix Trickle-Down Theorem on Simplicial Complexes and Applications to Sampling Colorings (Q6369691) (← links)
- Matroid Partition Property and the Secretary Problem (Q6383844) (← links)
- An Improved Trickle-Down Theorem for Partite Complexes (Q6407355) (← links)
- Complete Log Concavity of Coverage-Like Functions (Q6428643) (← links)
- On Optimization and Counting of Non-Broken Bases of Matroids (Q6435447) (← links)