Ravi R.

R. Ravi

Information about the author R. Ravi will soon be added to the site.
Found 10 papers in total
Approximation algorithms for problems combining facility location and network design
Approximation algorithms for problems combining facility location and network design
2006
We present approximation algorithms for integrated logistics problems that combine...
Min–Max payoffs in a two-player location game
Min–Max payoffs in a two-player location game
2006
We consider a two-player, sequential location game with arbitrarily distributed...
Approximation algorithms for a capacitated network design problem
Approximation algorithms for a capacitated network design problem
2003
We study a capacitated network design problem with applications in local access...
Min–max tree covers of graphs
Min–max tree covers of graphs
2004
We provide constant factor approximation algorithms for covering the nodes of a graph...
Reconstructing edge-disjoint paths
Reconstructing edge-disjoint paths
2003
For an undirected graph G = (V, E), the edge connectivity values between every pair of...
Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues
Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues
2001
Motivated by applications in the manufacturing and service industries, we consider two...
Approximation algorithms for degree-constrained minimum-cost network-design problems
Approximation algorithms for degree-constrained minimum-cost network-design problems
2001
We study network-design problems with two different design objectives: the total cost...
Approximation algorithms for degree-constrained minimum-cost network-design problems
Approximation algorithms for degree-constrained minimum-cost network-design problems
2001
We study network-design problems with two different design objectives: the total cost...
A polynomial-time approximation scheme for minimum routing cost spanning trees
A polynomial-time approximation scheme for minimum routing cost spanning trees
2000
Given an undirected graph with nonnegative costs on the edges, the routing cost of any...
Generalized vertex covering in interval graphs
Generalized vertex covering in interval graphs
1992
Given an integer i and an undirected graph G , the generalized i -vertex cover problem...
Papers per page: