Balancing minimum spanning trees and shortest-path trees von Khuller, S., Raghavachari, B., Young, N.

Volltext

Dual-homing protection in IP-over-WDM networks von Jianping Wang, Vokkarane, V.M., Jothi, R., Xiangtong Qi, Raghavachari, B., Jue, J.P.

Volltext

Approximation algorithms with bounded performance guarantees for the clustered traveling Salesman problem von GUTTMANN-BECK, N, HASSIN, R, KHULLER, S, RAGHAVACHARI, B

Volltext

Approximating the Minimum-Degree Steiner Tree to within One of Optimal von Furer, M., Raghavachari, B.

Volltext

Landmarks in graphs von Khuller, Samir, Raghavachari, Balaji, Rosenfeld, Azriel

Volltext

Approximation through local optimality: Designing networks with small degree von Ravi, R., Raghavachari, B., Klein, P.

Volltext

The e-mail gossip number and the connected domination number von Harary, F., Raghavachari, B.

Volltext

Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem von Gubbala, Prabhakar, Raghavachari, Balaji

Volltext

Finding k-Connected Subgraphs with Minimum Average Weight von Gubbala, Prabhakar, Raghavachari, Balaji

Volltext

Algorithms for capacitated vehicle routing von CHARIKAR, Moses, KHULLER, Samir, RAGHAVACHARI, Balaji

Volltext

Survivable network design: the capacitated minimum spanning network problem von Jothi, Raja, Raghavachari, Balaji

Volltext

Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems von Jothi, Raja, Raghavachari, Balaji

Volltext

Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design von Jothi, Raja, Raghavachari, Balaji

Volltext

Minimum Latency Tours and the k-Traveling Repairmen Problem von Jothi, Raja, Raghavachari, Balaji

Volltext

Low-degree spanning trees of small weight von KHULLER, S, BALAJI RAGHAVACHARI, YOUNG, N

Volltext

Approximation algorithms for finding low-degree subgraphs von Klein, Philip N., Krishnan, Radha, Raghavachari, Balaji, Ravi, R.

Volltext

Improved Approximation Algorithms for Uniform Connectivity Problems von Khuller, Samir, Raghavachari, Balaji

Volltext

An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs von Furer, M., Raghavachari, B.

Volltext

Approximating the minimum equivalent digraph von SAMIR KHULLER, BALAJI RAGHAVACHARI, YOUNG, N

Volltext

An efficient NC algorithm for finding Hamiltonian cycles in dense directed graphs von Fürer, Martin, Raghavachari, Balaji

Volltext