The following pages link to R. Ravi (Q208908):
Displaying 50 items.
- The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Efficient cost-sharing mechanisms for prize-collecting problems (Q494320) (← links)
- The directed orienteering problem (Q547309) (← links)
- An FPTAS for minimizing the product of two non-negative linear cost functions (Q623370) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- Min-max tree covers of graphs. (Q703232) (← links)
- A near Pareto optimal auction with budget constraints (Q765229) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983) (← links)
- An improved approximation algorithm for requirement cut (Q991474) (← links)
- A linear-time algorithm to compute a MAD tree of an interval graph (Q1029091) (← links)
- Generalized vertex covering in interval graphs (Q1199467) (← links)
- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree (Q1281780) (← links)
- Approximation algorithms for certain network improvement problems (Q1282208) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
- Approximation algorithms for the test cover problem (Q1424310) (← links)
- Approximation algorithms for the multiple knapsack problem with assignment restrictions (Q1583697) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- Multiple facility location on a network with linear reliability order of edges (Q1680498) (← links)
- Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems (Q1849676) (← links)
- Approximation algorithms for a capacitated network design problem (Q1879243) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set (Q1949686) (← links)
- Improving spanning trees by upgrading nodes (Q1960523) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- Two-level hub Steiner trees (Q2059893) (← links)
- On small-depth tree augmentations (Q2102832) (← links)
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
- The approximability of multiple facility location on directed networks with random arc failures (Q2196606) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- Algorithms for automatic ranking of participants and tasks in an anonymized contest (Q2272379) (← links)
- Inventory Routing problem with facility location (Q2285110) (← links)
- Plane gossip: approximating rumor spread in planar graphs (Q2294719) (← links)
- Approximation algorithms for minimizing average distortion (Q2432527) (← links)
- Approximating max-min weighted \(T\)-joins (Q2450657) (← links)
- Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (Q2462107) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- Local improvement algorithms for a path packing problem: a performance analysis based on linear programming (Q2661591) (← links)
- A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs (Q2670439) (← links)
- Approximation algorithm for the 2-stage stochastic matroid base problem (Q2670486) (← links)
- (Q2753737) (← links)
- Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
- Balls and Funnels: Energy Efficient Group-to-Group Anycasts (Q2817865) (← links)
