The following pages link to R. Ravi (Q208908):
Displaying 26 items.
- Designing Overlapping Networks for Publish-Subscribe Systems (Q5351912) (← links)
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (Q5359124) (← links)
- LP Rounding Approximation Algorithms for Stochastic Network Design (Q5388034) (← links)
- Approximation Algorithms for Multicommodity Facility Location Problems (Q5392908) (← links)
- (Q5417728) (← links)
- Short Tours through Large Linear Forests (Q5419002) (← links)
- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems (Q5449799) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479361) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479371) (← links)
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits (Q5495044) (← links)
- (Q5501277) (← links)
- Integer Programming and Combinatorial Optimization (Q5712477) (← links)
- (Q5743496) (← links)
- (Q5875455) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900919) (← links)
- Approximation algorithms for replenishment problems with fixed turnover times (Q5918783) (← links)
- Approximation algorithms for replenishment problems with fixed turnover times (Q5919410) (← links)
- Approximation algorithms for degree-constrained minimum-cost network-design problems (Q5946123) (← links)
- Exponential and input-output stability are equivalent for linear time-varying systems. (Q5955754) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) (Q5961617) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- (Q6059160) (← links)
- A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs (Q6365197) (← links)
- Dial a ride from \(k\)-forest (Q6486942) (← links)
- Timeliness through telephones: approximating information freshness in vector clock models (Q6538623) (← links)
- Approximation algorithms for Steiner tree augmentation problems (Q6538624) (← links)
