The following pages link to Yogish Sabharwal (Q315534):
Displayed 31 items.
- The update complexity of selection and related problems (Q315536) (← links)
- Efficient decentralized algorithms for the distributed trigger counting problem (Q693074) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Facility location with red-blue demands (Q1785285) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Set cover problems with small neighborhood covers (Q2322696) (← links)
- Replica placement on bounded treewidth graphs (Q2405277) (← links)
- Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions (Q2507694) (← links)
- A linear time algorithm for approximate 2-means clustering (Q2573339) (← links)
- (Q2908848) (← links)
- (Q2908854) (← links)
- (Q2911635) (← links)
- Improved Algorithms for Resource Allocation under Varying Capacity (Q2921407) (← links)
- Distributed algorithms for scheduling on line and tree networks (Q2933811) (← links)
- (Q2957492) (← links)
- (Q2957497) (← links)
- (Q2963918) (← links)
- (Q2963919) (← links)
- (Q2978515) (← links)
- Clustering with Internal Connectedness (Q3078394) (← links)
- Scheduling Resources for Throughput Maximization (Q3088087) (← links)
- Resource Allocation for Covering Time Varying Demands (Q3092259) (← links)
- Linear-time approximation schemes for clustering problems in any dimensions (Q3578186) (← links)
- Approximating Decision Trees with Multiway Branches (Q3638036) (← links)
- (Q4415266) (← links)
- Facility Location with Matroid or Knapsack Constraints (Q5252229) (← links)
- (Q5365103) (← links)
- Approximation Algorithms for the Weight-Reducible Knapsack Problem (Q5410644) (← links)
- The Priority k-Median Problem (Q5458823) (← links)
- Automata, Languages and Programming (Q5716761) (← links)
- (Q6187022) (← links)