#### Filter Results:

- Full text PDF available (79)

#### Publication Year

1991

2016

- This year (0)
- Last five years (29)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a ¡subgraph from a given subgraph-class that minimizes the second objective subject to the budget on the first.… (More)

- R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
- SIAM J. Discrete Math.
- 1994

We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number k of nodes are required to be connected in the solution. A prototypical example is the kMST problem in which we require a tree of minimum weight spanning at least k nodes in an edge-weighted graph. We show… (More)

- Alexander Russell, Ravi Sundaram
- Electr. J. Comb.
- 1998

A graph G is said to be d-distinguishable if there is a d-coloring of G which no non-trivial automorphism preserves. It was conjectured that if jGj > jAut(G)j and the Aut(G) action on G has no singleton orbits, then G is 2-distinguishable. We give an example where this fails. We partially repair the conjecture by showing that when " enough motion occurs, "… (More)

- Nikolaos Laoutaris, Georgios Smaragdakis, Pablo Rodriguez, Ravi Sundaram
- IEEE/ACM Transactions on Networking
- 2009

Many emerging scientific and industrial applications require transferring multiple Tbytes of data on a daily basis. Examples include pushing scientific data from particle accelerators/colliders to laboratories around the world, synchronizing data-centers across continents, and replicating collections of high definition videos from events taking place at… (More)

- Liang Zhang, Fangfei Zhou, Alan Mislove, Ravi Sundaram
- EuroSys
- 2013

Over the past two decades, the web has provided dramatic improvements in the ease of sharing content. Unfortunately, the costs of distributing this content are largely incurred by web site operators; popular web sites are required to make substantial monetary investments in serving infrastructure or cloud computing resources---or must pay other… (More)

- Ravi Kumar, Alexander Russell, Ravi Sundaram
- COCOON
- 1996

In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question is known to be NP-complete. We present two approximation algorithms for the optimization version of this question. We rst prove that the greedy algorithm achieves a factor of 1/3.… (More)

- Fangfei Zhou, Manish Goel, Peter Desnoyers, Ravi Sundaram
- 2011 IEEE 10th International Symposium on Network…
- 2011

Recently, cloud computing services such as Amazon EC2 have used virtualization to provide customers with virtual machines running on the provider's hardware, typically charging by wall clock time rather than resources consumed. Under this business model, manipulation of the scheduler may allow theft-of-service at the expense of other customers. We have… (More)

We introduce a notion of <i>universality</i> in the context of optimization problems with partial information. Universality is a framework for dealing with uncertainty by guaranteeing a certain quality of goodness for all possible completions of the partial information set. Universal variants of optimization problems can be defined that are both natural and… (More)

- Alexander Russell, Ravi Sundaram
- Computational Complexity
- 1998

We i n troduce the natural class S P 2 containing those languages which m a y be expressed in terms of two symmetric quantiiers. This class lies between P 2 and P 2 P 2 and naturally generates a symmetric" hierarchy corresponding to the polynomial-time hierarchy. W e demonstrate, using the probabilistic method, new containment theorems for BPP. W e show… (More)

- Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir, Ravi Sundaram
- Proceedings IEEE 24th Annual Joint Conference of…
- 2005

In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially overheard signals of previous transmissions for the same packet are used to decode it using a maximal ratio combiner technique [J.G. Proakis, 2001]. Therefore, additional energy saving… (More)