The following pages link to R. Ravi (Q208908):
Displaying 50 items.
- (Q4234131) (← links)
- (Q4234152) (← links)
- (Q4250159) (← links)
- (Q4250189) (← links)
- (Q4288579) (← links)
- (Q4395331) (← links)
- (Q4395332) (← links)
- (Q4411398) (← links)
- (Q4494412) (← links)
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem (Q4512573) (← links)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- (Q4537744) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q4542526) (← links)
- Optimal circuits for parallel multipliers (Q4571452) (← links)
- Improving spanning trees by upgrading nodes (Q4571960) (← links)
- LAST but not Least: Online Spanners for Buy-at-Bulk (Q4575775) (← links)
- Approximation algorithms for finding low-degree subgraphs (Q4651931) (← links)
- (Q4737529) (← links)
- (Q4796174) (← links)
- (Q4828991) (← links)
- (Q4829040) (← links)
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees (Q4840221) (← links)
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks (Q4842113) (← links)
- Spanning Trees—Short or Small (Q4881285) (← links)
- (Q4886063) (← links)
- (Q4886096) (← links)
- Online and Stochastic Survivable Network Design (Q4910579) (← links)
- (Q4938770) (← links)
- (Q4938792) (← links)
- Improving Minimum Cost Spanning Trees by Upgrading Nodes (Q4939607) (← links)
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees (Q4943844) (← links)
- (Q4952636) (← links)
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets (Q4962207) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- A New System-Wide Diversity Measure for Recommendations with Efficient Algorithms (Q5025771) (← links)
- Service-constrained network design problems (Q5054805) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) (Q5057461) (← links)
- Multicommodity Multicast, Wireless and Fast (Q5075826) (← links)
- Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
- (Q5111689) (← links)
- (Q5111735) (← links)
- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems (Q5167870) (← links)
- Online and stochastic survivable network design (Q5172766) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191526) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- Many birds with one stone (Q5248513) (← links)
- Rumors Across Radio, Wireless, Telephone (Q5275393) (← links)
- STACS 2004 (Q5309703) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313046) (← links)
- Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds (Q5317173) (← links)
