# Ramnik Bajaj

- Citations Per Year

- Citations Per Year

- Full text PDF available (1)

Learn More

- Ramnik Bajaj, C. P. Ravikumar, Suresh Chandra
- HiPC
- 1997

The problem of finding an optimal multicast tree in a point to point network translates to the Steiner Problem in graphs. Since the Steiner problem is NPcomplete, heuristic approaches are required for path setup. The problem takes a new dimension in Wide Area Networks, where centralized algorithms are not feasible , and distributed schemes are needed. It is… (More)

- ‹
- 1
- ›