The following pages link to Yuval Rabani (Q222776):
Displaying 43 items.
- An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm (Q4388872) (← links)
- (Q4411271) (← links)
- Allocating Bandwidth for Bursty Connections (Q4507345) (← links)
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces (Q4507359) (← links)
- (Q4527032) (← links)
- (Q4527034) (← links)
- (Q4542519) (← links)
- (Q4542584) (← links)
- Matrix Balancing in <i>L</i><sub>p</sub> Norms: Bounding the Convergence Rate of Osborne's Iteration (Q4575746) (← links)
- Convergence of Incentive-Driven Dynamics in Fisher Markets (Q4575772) (← links)
- Approximation Algorithms for the 0-Extension Problem (Q4651539) (← links)
- A computational view of population genetics (Q4705315) (← links)
- (Q4737541) (← links)
- (Q4875206) (← links)
- (Q4886081) (← links)
- (Q4886092) (← links)
- On the Value of Coordination in Distributed Decision Making (Q4887014) (← links)
- An Improved Competitive Algorithm for Reordering Buffer Management (Q4962197) (← links)
- Bicriteria approximation tradeoff for the node-cost budget problem (Q4962785) (← links)
- Error-Correcting Codes for Automatic Control (Q4975907) (← links)
- Approximating sparsest cut in low rank graphs via embeddings from approximately low-dimensional spaces (Q5002624) (← links)
- (Q5002775) (← links)
- Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions (Q5048295) (← links)
- Explicit construction of a small epsilon-net for linear threshold functions (Q5172761) (← links)
- Approximation algorithms for constrained for constrained node weighted steiner tree problems (Q5175992) (← links)
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems (Q5386209) (← links)
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems (Q5388006) (← links)
- Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions (Q5390604) (← links)
- The effectiveness of lloyd-type methods for the k-means problem (Q5395696) (← links)
- (Q5417601) (← links)
- (Q5692700) (← links)
- A Constant Factor Approximation Algorithm for Reordering Buffer Management (Q5741778) (← links)
- (Q5874506) (← links)
- Subquadratic approximation algorithms for clustering problems in high dimensional spaces (Q5890867) (← links)
- Subquadratic approximation algorithms for clustering problems in high dimensional spaces (Q5894899) (← links)
- Low distortion embeddings for edit distance (Q5900522) (← links)
- Low distortion embeddings for edit distance (Q5901101) (← links)
- Cell-probe lower bounds for the partial match problem (Q5917577) (← links)
- Fairness in routing and load balancing (Q5952449) (← links)
- Parametrized Metrical Task Systems (Q6084418) (← links)
- (Q6090888) (← links)
- The Randomized $k$-Server Conjecture is False! (Q6416841) (← links)
- Generalized unrelated machine scheduling problem (Q6538639) (← links)
