The following pages link to Samir Khuller (Q194031):
Displaying 50 items.
- \(z\)-approximations (Q2775899) (← links)
- Algorithms for capacitated vehicle routing (Q2784475) (← links)
- Low degree spanning trees of small weight (Q2817632) (← links)
- Optimal Batch Schedules for Parallel Machines (Q2842183) (← links)
- Set Cover Revisited: Hypergraph Cover with Hard Capacities (Q2843299) (← links)
- The load-distance balancing problem (Q2892142) (← links)
- Approximation algorithms for data placement on parallel disks (Q2930259) (← links)
- Achieving anonymity via clustering (Q2930330) (← links)
- New Models and Algorithms for Throughput Maximization in Broadcast Scheduling (Q3075451) (← links)
- The Lattice Structure of Flow in Planar Graphs (Q3136618) (← links)
- (Q3138288) (← links)
- (Q3140426) (← links)
- New Approximation Results for Resource Replication Problems (Q3167398) (← links)
- To fill or not to fill (Q3189019) (← links)
- Broadcast scheduling (Q3189032) (← links)
- Efficient Parallel Algorithms for Testing<i>k</i>and Finding Disjoint<i>s</i>-<i>t</i>Paths in Graphs (Q3210185) (← links)
- To Fill or Not to Fill: The Gas Station Problem (Q3527241) (← links)
- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection (Q3541120) (← links)
- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity (Q3541794) (← links)
- Dependent rounding and its applications to approximation algorithms (Q3546323) (← links)
- (Q3579403) (← links)
- A robust maximum completion time measure for scheduling (Q3581492) (← links)
- Improved Algorithms for Data Migration (Q3595395) (← links)
- On Finding Dense Subgraphs (Q3638066) (← links)
- (Q3817629) (← links)
- Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph (Q4016910) (← links)
- (Q4028895) (← links)
- Approximation Algorithms for Graph Augmentation (Q4033765) (← links)
- (Q4036608) (← links)
- (Q4037416) (← links)
- (Q4228432) (← links)
- (Q4231912) (← links)
- (Q4234045) (← links)
- (Q4234153) (← links)
- Greedy Strikes Back: Improved Facility Location Algorithms (Q4240134) (← links)
- (Q4247262) (← links)
- (Q4247267) (← links)
- (Q4250234) (← links)
- (Q4252380) (← links)
- (Q4252419) (← links)
- Biconnectivity approximations and graph carvings (Q4299007) (← links)
- A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers (Q4312226) (← links)
- (Q4335208) (← links)
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134) (← links)
- (Q4395328) (← links)
- (Q4449173) (← links)
- Capacitated vertex covering (Q4458880) (← links)
- The Capacitated <i>K</i>-Center Problem (Q4490794) (← links)
- The Loading Time Scheduling Problem (Q4500856) (← links)
- (Q4535021) (← links)
