#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1999

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Zuzana Beerliova, Felix Eberhard, +4 authors L. Shankar Ram
- IEEE Journal on Selected Areas in Communications
- 2005

— Due to its fast, dynamic, and distributed growth process, it is hard to obtain an accurate map of the Internet. In many cases such a map—representing the structure of the Internet as a graph with nodes and links—is a prerequisite when investigating properties of the Internet. A common way to obtain such maps is to make certain local measurements at a… (More)

- L. Sunil Chandran, L. Shankar Ram
- COCOON
- 2002

We relate the number of minimum cuts in a weighted undirected graph with various structural parameters of the graph. In particular, we provide upper bounds for the number of minimum cuts in terms of the radius, diameter, minimum degree, maximum degree, chordality, girth, and some other parameters of the graph. 1. Introduction. Let G = (V, E) be a graph or a… (More)

- L. Sunil Chandran, L. Shankar Ram
- STACS
- 2002

- Markus Bläser, L. Shankar Ram, Maxim Sviridenko
- Oper. Res. Lett.
- 2005

We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ∆-Max-ATSP and a 3 4-approximation algorithm for Max-3-DCC with polynomial running time. The results are obtained via a new way of applying techniques for computing undirected cycle… (More)

- Markus Bläser, L. Shankar Ram
- FCT
- 2005

- Bodo Manthey, L. Shankar Ram
- Algorithmica
- 2006

We analyze approximation algorithms for several variants of the traveling salesman problem with multiple objective functions. First, we consider the symmetric TSP (STSP) with γ-triangle inequality. For this problem, we present a determin-istic polynomial-time algorithm that achieves an approximation ratio of min{1 + γ, 2γ 2 2γ 2 −2γ+1 } + ε and a randomized… (More)

- Markus Bläser, L. Shankar Ram
- Theory Comput. Syst.
- 2008

- L. Sunil Chandran, L. Shankar Ram
- Theor. Comput. Sci.
- 2007

Processing of physiological signals often involves detection of peaks and finding intervals between them. Well developed methods are available for Electrocardiogram(ECG) QRS complex detection. However, there are only a few algorithms published for peak detection suitable for pulse wave signals such as arterial pressure wave and photoplethysmographic (PPG)… (More)

In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed… (More)