MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Balaji Raghavachari" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

28 documents found, showing 1 through 10. Next 10 →

ATOM

Approximating the minimum-degree Steiner tree to within one of optimal
by Balaji Raghavachari — 1994 — Journal of Algorithms
…"urer\Lambda Balaji Raghavachari y Abstract The problem of constructing a spanning tree for a graph G = (V; E) with n…
Cited by 45 (5 self) – Add To MetaCart

A 3/2-approximation algorithm for the Windy Postman Problem
by Balaji Raghavachari, Jeyakesavan Veerasamy — 2001
…A 3/2-approximation algorithm for the Windy Postman Problem Balaji Raghavachari y Jeyakesavan…
Add To MetaCart

Minimum Latency Tours and the k-Traveling Repairmen Problem
by Raja Jothi, Balaji Raghavachari — 2004 — in: Proc. Latin American Theoretical INformatics (LATIN), 2004
…Minimum Latency Tours and the k-Traveling Repairmen Problem Raja Jothi y Balaji Raghavachari y…
Cited by 5 (1 self) – Add To MetaCart

The directed minimum-degree spanning tree problem
by Radha Krishnan, Balaji Raghavachari — 2001 — In Foundations of Software Technology and Theoretical Computer Science (FSTTCS
…The Directed Minimum-Degree Spanning Tree Problem ⋆ Radha Krishnan and Balaji Raghavachari…
Cited by 6 (0 self) – Add To MetaCart

Finding k-connected subgraphs with minimum average weight
by Prabhakar Gubbala, Balaji Raghavachari — 2004 — In Proceedings of the 6th Latin American Theoretical Informatics Symposium (LATIN
…Finding k-Connected Subgraphs with Minimum Average Weight Prabhakar Gubbala and Balaji…
Cited by 1 (0 self) – Add To MetaCart

Survivable Network Design: The Capacitated Minimum Spanning Network Problem
by Raja Jothi, Balaji Raghavachari — 2004 — In Proc. 7th INFORMS Telecommunications Conf
…Survivable Network Design: The Capacitated Minimum Spanning Network Problem Raja Jothi Balaji…
Cited by 3 (2 self) – Add To MetaCart

Dynamic Capacitated Minimum Spanning Trees
by Raja Jothi, Balaji Raghavachari — 2004 — In Proc. 3rd Intl. Conf. on Networking (ICN
…Dynamic Capacitated Minimum Spanning Trees Raja Jothi and Balaji Raghavachari Department…
Cited by 2 (2 self) – Add To MetaCart

Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems
by Raja Jothi, Balaji Raghavachari — 2003 — In Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT
… Jothi and Balaji Raghavachari University of Texas at Dallas, Richardson, TX 75083, USA fraja, rbkg…
Cited by 3 (1 self) – Add To MetaCart

Approximation Algorithms for Mixed Postman Problem
by Balaji Raghavachari, Jeyakesavan Veerasamy — 1998 — SIAM J. Discrete Math
…Approximation Algorithms for Mixed Postman Problem Balaji Raghavachari Jeyakesavan Veerasamy y…
Cited by 1 (1 self) – Add To MetaCart

Placement of Proxy Servers to Support Server-Based Reliable Multicast
by Raja Jothi, Balaji Raghavachari — 2004 — In Proc. of IEEE International Conference on Networking
…Placement of Proxy Servers to Support Server-Based Reliable Multicast Raja Jothi and Balaji…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB