The following pages link to R. Ravi (Q208908):
Displayed 50 items.
- Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (Q2843243) (← links)
- Geometry of Online Packing Linear Programs (Q2843293) (← links)
- Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
- Technical Note—Approximation Algorithms for VRP with Stochastic Demands (Q2892219) (← links)
- Solving the Capacitated Local Access Network Design Problem (Q2901009) (← links)
- (Q2920152) (← links)
- (Q2921660) (← links)
- Dial a Ride from <i>k</i> -forest (Q2930320) (← links)
- (Q2934689) (← links)
- (Q2934710) (← links)
- Graph-TSP from Steiner Cycles (Q2945200) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- (Q2969619) (← links)
- (Q2969624) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- (Q3024801) (← links)
- Game-Theoretic Models of Information Overload in Social Networks (Q3067515) (← links)
- Iterative Methods in Combinatorial Optimization (Q3087101) (← links)
- Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues (Q3114674) (← links)
- Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems (Q3115871) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- (Q3128917) (← links)
- (Q3129923) (← links)
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees (Q3149894) (← links)
- A matter of degree (Q3192023) (← links)
- Approximation Algorithms for Problems Combining Facility Location and Network Design (Q3391962) (← links)
- Matching Based Augmentations for Approximating Connectivity Problems (Q3525741) (← links)
- Dial a Ride from k-Forest (Q3527216) (← links)
- Pricing Tree Access Networks with Connected Backbones (Q3527238) (← links)
- The Directed Minimum Latency Problem (Q3541796) (← links)
- Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees (Q3545135) (← links)
- Line-of-Sight Networks (Q3557508) (← links)
- Boosted sampling (Q3580986) (← links)
- Primal-dual meets local search (Q3581300) (← links)
- Thresholded Covering Algorithms for Robust and Max-min Optimization (Q3587385) (← links)
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (Q3587419) (← links)
- Minimum Vehicle Routing with a Common Deadline (Q3595416) (← links)
- On Two-Stage Stochastic Minimum Spanning Trees (Q3596356) (← links)
- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems (Q3603470) (← links)
- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs (Q3613758) (← links)
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction (Q3613799) (← links)
- Iterative Rounding for Multi-Objective Optimization Problems (Q3639238) (← links)
- Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links (Q3639252) (← links)
- Minimum Makespan Multi-vehicle Dial-a-Ride (Q3639273) (← links)
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs (Q3989542) (← links)
- (Q4036610) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time (Q4217304) (← links)
- (Q4228499) (← links)
- (Q4234131) (← links)