MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Raja Jothi" – sorted by Relevance.

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

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

10 documents found, showing 1 through 10.

ATOM

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

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
…Improved Approximation Algorithms for the Single-Sink Buy-At-Bulk Network Design Problems Raja…
Cited by 3 (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

Degree-Bounded Minimum Spanning Trees
by Raja Jothi, Balaji Raghavachari — 2004
…Degree-Bounded Minimum Spanning Trees Raja Jothi y Balaji Raghavachari y Abstract Given n…
Cited by 1 (0 self) – Add To MetaCart

Revisiting Esau-Williams' Algorithm: On the Design of Local Access Networks
by Raja Jothi And, Raja Jothi, Balaji Raghavachari — 2004 — In Proc. 7th INFORMS Telecommunications Conf
…Revisiting Esau-Williams' Algorithm: On the Design of Local Access Networks 1 Raja Jothi…
Add To MetaCart

Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and its Variants in Network Design
by Raja Jothi, Balaji Raghavachari, V Demand V — 2004
… in Network Design # Raja Jothi + Balaji Raghavachari + Abstract Given an undirected graph G = (V, E…
Cited by 5 (4 self) – Add To MetaCart

A 5/4-Approximation Algorithm for Minimum 2-Edge-Connectivity
by Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan — 2003
…A 5/4-approximation algorithm for minimum 2-edge-connectivity Raja Jothi Balaji Raghavachari…
Cited by 8 (0 self) – Add To MetaCart

Decomposition of overlapping protein complexes: A graph
by Elena Zotenko, Katia S Guimarães, Raja Jothi, Teresa M Przytycka, Teresa M Przytycka — 2006
…,2 , Katia S Guimarães 1,3 , Raja Jothi 1 and Teresa M Przytycka* 1 Open Access Address: 1National Center…
Add To MetaCart

Showing 1 through 10.

ATOM

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