The following pages link to Nikhil Bansal (Q313449):
Displayed 50 items.
- Deterministic Discrepancy Minimization (Q3092247) (← links)
- A Polylogarithmic-Competitive Algorithm for the <i>k</i> -Server Problem (Q3177748) (← links)
- (Q3181596) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- (Q3191563) (← links)
- (Q3299220) (← links)
- On‐line balancing of random inputs (Q3386519) (← links)
- Speed Scaling with a Solar Cell (Q3511410) (← links)
- Scheduling for Speed Bounded Processors (Q3521936) (← links)
- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching (Q3527240) (← links)
- Speed scaling to manage energy and temperature (Q3546328) (← links)
- (Q3549707) (← links)
- On k-Column Sparse Packing Programs (Q3569831) (← links)
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows (Q3580966) (← links)
- Server scheduling in the L <sub>p</sub> norm (Q3581295) (← links)
- Improved approximation algorithms for broadcast scheduling (Q3581494) (← links)
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing (Q3586179) (← links)
- Speed Scaling for Weighted Flow Time (Q3586181) (← links)
- Additive Guarantees for Degree-Bounded Directed Network Design (Q3586186) (← links)
- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Q3586398) (← links)
- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems (Q3587384) (← links)
- Metrical Task Systems and the k-Server Problem on HSTs (Q3587386) (← links)
- Better Scalable Algorithms for Broadcast Scheduling (Q3587389) (← links)
- Minimizing Setup and Beam-On Times in Radiation Therapy (Q3595380) (← links)
- Improved Approximation Algorithms for Broadcast Scheduling (Q3631906) (← links)
- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability (Q3652193) (← links)
- (Q4418655) (← links)
- (Q4471337) (← links)
- (Q4473894) (← links)
- (Q4511230) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- Improved Approximation for Vector Bin Packing (Q4575690) (← links)
- The (<i>h</i>, <i>k</i>)-Server Problem on Bounded Depth Trees (Q4575805) (← links)
- LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs (Q4575875) (← links)
- (Q4607947) (← links)
- (Q4607969) (← links)
- (Q4633881) (← links)
- (Q4633882) (← links)
- (Q4633939) (← links)
- An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound (Q4634029) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Multicast Routing for Energy Minimization Using Speed Scaling (Q4916030) (← links)
- Better Scalable Algorithms for Broadcast Scheduling (Q4962161) (← links)
- Minimizing weighted flow time (Q4962678) (← links)
- The ( <i>h,k</i> )-Server Problem on Bounded Depth Trees (Q4972671) (← links)
- Faster space-efficient algorithms for subset sum and k-sum (Q4977972) (← links)
- Algorithmic discrepancy beyond partial coloring (Q4978034) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- (Q5091067) (← links)
- On the discrepancy of random low degree set systems (Q5136929) (← links)