The following pages link to Nikhil Bansal (Q313449):
Displayed 50 items.
- On the number of matroids (Q313452) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Item:Q313449 (redirect page) (← links)
- An entropy argument for counting matroids (Q462939) (← links)
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Average rate speed scaling (Q547302) (← links)
- Competitive algorithms for due date scheduling (Q633847) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Correlation clustering (Q703079) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- Handling load with less stress (Q851238) (← links)
- Finding submasses in weighted strings with fast Fourier transform (Q876468) (← links)
- On the adaptivity gap of stochastic orienteering (Q896283) (← links)
- Robust reductions from ranking to classification (Q1009271) (← links)
- Speed scaling with a solar cell (Q1035690) (← links)
- Analysis of the M/G/1 processor-sharing queue with bulk arrivals (Q1400352) (← links)
- A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues (Q1433665) (← links)
- Tight approximation bounds for dominating set on graphs of bounded arboricity (Q1675919) (← links)
- Tight bounds for double coverage against weak adversaries (Q1743121) (← links)
- Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
- Non-clairvoyant scheduling for minimizing mean slowdown (Q1884774) (← links)
- Nested convex bodies are chaseable (Q1987239) (← links)
- Deterministic discrepancy minimization (Q2017871) (← links)
- Contention resolution, matrix scaling and fair allocation (Q2085755) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- The local-global conjecture for scheduling with non-linear cost (Q2400434) (← links)
- Two-dimensional bin packing with one-dimensional resource augmentation (Q2467124) (← links)
- On the average sojourn time under \(M/M/1/\)SRPT (Q2488224) (← links)
- Tight Bounds for Double Coverage Against Weak Adversaries (Q2788990) (← links)
- (Q2830868) (← links)
- A Harmonic Algorithm for the 3D Strip Packing Problem (Q2840983) (← links)
- Randomized Competitive Algorithms for Generalized Caching (Q2903523) (← links)
- Weighted Geometric Set Multi-cover via Quasi-uniform Sampling (Q2912836) (← links)
- (Q2913804) (← links)
- (Q2921672) (← links)
- (Q2921673) (← links)
- Dynamic pricing for impatient bidders (Q2930314) (← links)
- The Santa Claus problem (Q2931367) (← links)
- A quasi-PTAS for unsplittable flow on line graphs (Q2931432) (← links)
- Speed Scaling with an Arbitrary Power Function (Q2933648) (← links)
- (Q2934659) (← links)
- (Q2934667) (← links)
- (Q2934715) (← links)
- On the Lovász Theta function for Independent Sets in Sparse Graphs (Q2941507) (← links)
- Minimizing Flow-Time on Unrelated Machines (Q2941582) (← links)
- Minimum congestion mapping in a cloud (Q2943405) (← links)
- Weighted geometric set multi-cover via quasi-uniform sampling (Q2970451) (← links)
- On Capacitated Set Cover Problems (Q3088080) (← links)