#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1987

2019

- This year (1)
- Last 5 years (11)
- Last 10 years (23)

#### Supplemental Content

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

In the k-server problem, one must choose how k mobile servers will serve each of a sequence of requests, making decisions in an online manner. An optimal deterministic online strategy is exhibited… (More)

- Mario Szegedy, Sundar Vishwanathan
- STOC
- 1993

We study the problem of locality based graph coloring. This problem is motivated by the problem of assigning time slots for broadcast in mobile packet radio networks. This problem has also been… (More)

An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two

- Sundar Vishwanathan
- Inf. Process. Lett.
- 1992

Abstract We present an approximation algorithm, with a performance ratio of at most 17⧸12, for the asymmetric travelling salesman problem with distances one and two. This problem is equivalent (in a… (More)

- Sundar Vishwanathan
- J. Algorithms
- 1992

We study the problem of coloring graphs in an online manner. The only known deterministic online graph coloring algorithm with a sublinear performance function was found by Lovasz, Saks, and Trotter,… (More)

- K. S. Sudeep, Sundar Vishwanathan
- Discrete Mathematics
- 2005

In order to avoid interference in cellular telephone networks, sets of radio frequencies are to be assigned to transmitters such that adjacent transmitters are allotted disjoint sets of frequencies.… (More)

- Sundar Vishwanathan
- SODA
- 2000

In this paper we present a polynomial-time algorithm that finds paths of length Ω((log n/ log log n)2) in undirected Hamiltonian graphs, improving the previous best of Ω(log n).

We investigate the power of randomized algorithms for the maximum cardinality matching (MCM) and the maximum weight matching (MWM) problems in the online preemptive model. In this model, the edges of… (More)

- Ashish Chiplunkar, Sundar Vishwanathan
- IEEE 54th Annual Symposium on Foundations of…
- 2013

The weighted k-server problem is a generalization of the k-server problem in which the cost of moving a server of weight β<sub>i</sub> through a distance d is β<sub>i</sub> · d. The weighted server… (More)

- Sumedh Tirodkar, Sundar Vishwanathan
- COCOON
- 2016

We study the Maximum Cardinality Matching (MCM) and the Maximum Weight Matching (MWM) problems, on trees and on some special classes of graphs, in the Online Preemptive and the Incremental Dynamic… (More)

- K. S. Sudeep, Sundar Vishwanathan
- Discrete Mathematics
- 2007

The set of problems we consider here are generalizations of square-free sequences [A. Thue, Uber unendliche Zeichenreichen, Norske Vid Selsk. Skr. I. Mat. Nat. Kl. Christiana 7 (1906) 1-22]. A finite… (More)