#### Filter Results:

- Full text PDF available (45)

#### Publication Year

1974

2017

- This year (2)
- Last 5 years (10)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
- STOC
- 2004

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)

- Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha
- Oper. Res. Lett.
- 2004

We provide constant factor approximation algorithms for covering the nodes of a graph using trees (rooted or unrooted), under the objective function of minimizing the weight of the maximum weight tree, subject to an upper bound on the number of trees used. These problems are related to location routing and traveling salesperson problems.

- R. Ravi, Amitabh Sinha
- IPCO
- 2004

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)

- Jochen Könemann, Asaf Levin, Amitabh Sinha
- Algorithmica
- 2003

We consider the problem of finding a minimum diameter spanning tree with maximum node degree $B$ in a complete undirected edge-weighted graph. We provide an $O(\sqrt{\log_Bn})$-approximation algorithm for the problem. Our algorithm is purely combinatorial, and relies on a combination of filtering and divide and conquer.

- R. Ravi, Amitabh Sinha
- SODA
- 2004

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)

- Anupam Gupta, R. Ravi, Amitabh Sinha
- 45th Annual IEEE Symposium on Foundations of…
- 2004

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)

- Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha
- SODA
- 2005

Consider the following classical network design problem: a set of terminals <i>T</i> = {<i>t<sub>i</sub></i>} wishes to send traffic to a root <i>r</i> in an <i>n</i>-node graph <i>G</i> = (<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)

- Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
- Algorithmica
- 2000

A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree (closed walk) and covers every other edge in the graph. Arkin et al. give approximation algorithms with ratios 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with a worst-case ratio of 3 for both problems.

- Amitabh Sinha, Laxmikant V. Kal
- 1993

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)