57 citations · 154 across the 36 of their papers we have counts for
4 papers · 2 filters
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
Thomas Bosman, Martijn van Ee, Yang Jiao +3
We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the lit…
Coloring Down: -approximation for special cases of the weighted tree augmentation problem
Jennifer Iglesias, R. Ravi
In this paper, we investigate the weighted tree augmentation problem (TAP), where the goal is to augment a tree with a minimum cost set of edges such that the graph becomes two edg…
Single-sink Fractionally Subadditive Network Design
Guru Guruganesh, Jennifer Iglesias, R. Ravi +1
We study a generalization of the Steiner tree problem, where we are given a weighted network together with a collection of subsets of its vertices and a root . We wish t…
Shorter tours and longer detours: Uniform covers and a bit beyond
Arash Haddadan, Alantha Newman, R. Ravi
Motivated by the well known four-thirds conjecture for the traveling salesman problem (TSP), we study the problem of {\em uniform covers}. A graph has an -uniform cove…