The following pages link to Nitish Korula (Q2354025):
Displaying 19 items.
- Approximability of capacitated network design (Q2354026) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- Overlap number of graphs (Q2888876) (← links)
- Bicriteria Online Matching: Maximizing Weight and Cardinality (Q2937766) (← links)
- Online Submodular Welfare Maximization (Q2941586) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- (Q3165952) (← links)
- (Q3165953) (← links)
- Improved algorithms for orienteering and related problems (Q3189064) (← links)
- (Q3191563) (← links)
- A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests (Q3192151) (← links)
- On k-Column Sparse Packing Programs (Q3569831) (← links)
- (Q3579451) (← links)
- Online Stochastic Packing Applied to Display Ad Allocation (Q3586461) (← links)
- A Graph Reduction Step Preserving Element-Connectivity and Applications (Q3638039) (← links)
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs (Q3638868) (← links)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- Algorithms for Secretary Problems on Graphs and Hypergraphs (Q5321681) (← links)
- (Q5365098) (← links)