Amitabh Sinha

Learn More
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the S<sc>teiner</sc> T<sc>ree</sc> problem, for example, edges must be chosen to connect terminals (clients); in V<sc>ertex</sc> C<sc>over</sc>, vertices must be chosen to cover edges(More)
We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our problems range from the graph-theoretic (shortest path, vertex cover, facility location) to set-theoretic (set cover, bin packing), and contain representatives with different approximation(More)
Multicommodity facility location refers to the extension of facility location to allow for different clients having demand for different goods, from among a finite set of goods. This leads to several optimization problems, depending on the costs of opening facilities (now a function of the commodities it serves). In this paper, we introduce and study some(More)
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field of stochastic optimization deals with such problems where the forecasts are specified in terms of probability distributions of future data. In this paper, we broaden the set of(More)
Consider the following classical network design problem: a set of terminals <i>T</i> &equals; &lcub;<i>t<sub>i</sub></i>&rcub; wishes to send traffic to a root <i>r</i> in an <i>n</i>-node graph <i>G</i> &equals; (<i>V</i>, <i>E</i>). Each terminal <i>t<sub>i</sub></i> sends <i>d<sub>i</sub></i> units of traffic and enough bandwidth has to be allocated on(More)
A large number of quiescence detection algorithms with good theoretical upper-bounds have been proposed before. However the metric used to measure the performance of these algorithms is not suitable. We propose a new metric for measuring the performance of a quiescence detection algorithm. We also present an algorithm to detect quiescence in an asynchronous(More)