The following pages link to Konstantin Makarychev (Q818637):
Displayed 50 items.
- Approximation algorithms for spanner problems and directed Steiner forest (Q1951575) (← links)
- A new class of non-Shannon-type inequalities for entropies (Q2493516) (← links)
- Metric extension operators, vertex sparsifiers and Lipschitz extendability (Q2630142) (← links)
- Union of Euclidean Metric Spaces is Euclidean (Q2826222) (← links)
- Near-optimal algorithms for maximum constraint satisfaction problems (Q2930257) (← links)
- Near-optimal algorithms for unique games (Q2931385) (← links)
- (Q2934583) (← links)
- (Q2934636) (← links)
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (Q2941510) (← links)
- (Q2957878) (← links)
- Sorting noisy data with partial information (Q2986898) (← links)
- Chain Independence and Common Information (Q2989834) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- Maximizing Polynomials Subject to Assignment Constraints (Q3012829) (← links)
- Local Global Tradeoffs in Metric Embeddings (Q3068641) (← links)
- How to Play Unique Games on Expanders (Q3075461) (← links)
- (Q3113698) (← links)
- Approximation Algorithm for Non-boolean MAX k-CSP (Q3167401) (← links)
- (Q3295547) (← links)
- (Q3579387) (← links)
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (Q3581406) (← links)
- Directed metrics and directed graph partitioning problems (Q3581572) (← links)
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm (Q3587410) (← links)
- On Hardness of Pricing Items for Single-Minded Bidders (Q3638879) (← links)
- Maximizing Polynomials Subject to Assignment Constraints (Q4554944) (← links)
- Robust algorithms with polynomial loss for near-unanimity CSPs (Q4575759) (← links)
- Minimum nonuniform graph partitioning with unrelated weights (Q4610203) (← links)
- Solving Optimization Problems with Diseconomies of Scale via Decoupling (Q4625663) (← links)
- (Q4636444) (← links)
- Algorithms for stable and perturbation-resilient problems (Q4977992) (← links)
- (Q4993604) (← links)
- Perturbation Resilience (Q5027271) (← links)
- Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering (Q5067443) (← links)
- Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms (Q5166263) (← links)
- Nonuniform Graph Partitioning with Unrelated Weights (Q5167794) (← links)
- Precedence-Constrained Scheduling of Malleable Jobs with Preemption (Q5167795) (← links)
- Integrality gaps for Sherali-Adams relaxations (Q5172722) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Performance of Johnson-Lindenstrauss transform for <i>k</i> -means and <i>k</i> -medians clustering (Q5212843) (← links)
- Nonlinear dimension reduction via outer Bi-Lipschitz extensions (Q5230364) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- Constant factor approximation for balanced cut in the PIE model (Q5259537) (← links)
- Bilu–Linial Stable Instances of Max Cut and Minimum Multiway Cut (Q5384028) (← links)
- Approximation Algorithm for Sparsest <i>k</i>-Partitioning (Q5384054) (← links)
- THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND (Q5401649) (← links)
- Approximation algorithms for semi-random partitioning problems (Q5415488) (← links)
- Min-Max Graph Partitioning and Small Set Expansion (Q5494941) (← links)
- How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games (Q5494983) (← links)
- Min-max Graph Partitioning and Small Set Expansion (Q5495004) (← links)
- The Grothendieck Constant is Strictly Smaller than Krivine's Bound (Q5495024) (← links)