Balaji Raghavachari

According to our database, Balaji Raghavachari authored at least 55 papers between 1992 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2018

Greedy Methods.

Samir Khuller, Balaji Raghavachari, Neal E. Young

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2016

Graph Connectivity.

Samir Khuller, Balaji Raghavachari

Encyclopedia of Algorithms, 2016

2014

Graph and Network Algorithms.

Samir Khuller, Balaji Raghavachari

Proceedings of the Computing Handbook, 2014

2011

DOMINE: a comprehensive collection of known and predicted domain-domain interactions.

Sailu Yellaboina, Asba Tasneem, Dmitri V. Zaykin, Balaji Raghavachari, Raja Jothi

Nucleic Acids Res., 2011

2010

Finding Maximum Reliable Path in Mesh Networks under Multiple Failures.

Shengli Yuan, Balaji Raghavachari, Ankitkumar Patel

Proceedings of the 19th International Conference on Computer Communications and Networks, 2010

A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability.

Shengli Yuan, Balaji Raghavachari, Lei Chen

Proceedings of the Global Communications Conference, 2010

2009

Improved approximation algorithms for the single-sink buy-at-bulk network design problems.

Raja Jothi, Balaji Raghavachari

J. Discrete Algorithms, 2009

Degree-bounded minimum spanning trees.

Raja Jothi, Balaji Raghavachari

Discret. Appl. Math., 2009

2008

Graph Connectivity.

Samir Khuller, Balaji Raghavachari

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

DOMINE: a database of protein domain interactions.

Balaji Raghavachari, Asba Tasneem, Teresa M. Przytycka, Raja Jothi

Nucleic Acids Res., 2008

2007

Greedy Methods.

Samir Khuller, Balaji Raghavachari, Neal E. Young

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Approximating the k-traveling repairman problem with repairtimes.

Raja Jothi, Balaji Raghavachari

J. Discrete Algorithms, 2007

A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity.

Prabhakar Gubbala, Balaji Raghavachari

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2006

Load-balanced agent activation for value-added network services.

Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi

Comput. Commun., 2006

2005

Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design.

Raja Jothi, Balaji Raghavachari

ACM Trans. Algorithms, 2005

Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem.

Prabhakar Gubbala, Balaji Raghavachari

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

Approximation algorithms for finding low-degree subgraphs.

Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi

Networks, 2004

Survivable network design: the capacitated minimum spanning network problem.

Raja Jothi, Balaji Raghavachari

Inf. Process. Lett., 2004

Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case.

Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç

Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Minimum Latency Tours and the k-Traveling Repairmen Problem.

Raja Jothi, Balaji Raghavachari

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Finding k-Connected Subgraphs with Minimum Average Weight.

Prabhakar Gubbala, Balaji Raghavachari

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Dynamic dual-homing protection in WDM mesh networks.

Vinod Vokkarane, Jianping Wang, Xiangtong Qi, Raja Jothi, Balaji Raghavachari, Jason P. Jue

Proceedings of IEEE International Conference on Communications, 2004

Load balancing for reliable multicast.

Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç

Proceedings of the IASTED International Conference on Communications, Internet, and Information Technology, November 22, 2004

2003

A 5/4-approximation algorithm for minimum 2-edge-connectivity.

Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2001

Algorithms for Capacitated Vehicle Routing.

Moses Charikar, Samir Khuller, Balaji Raghavachari

SIAM J. Comput., 2001

The Directed Minimum-Degree Spanning Tree Problem.

Radha Krishnan, Balaji Raghavachari

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

2000

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.

Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari

Algorithmica, 2000

1999

A 3/2-Approximation Algorithm for the Mixed Postman Problem.

Balaji Raghavachari, Jeyakesavan Veerasamy

SIAM J. Discret. Math., 1999

Approximation Algorithms for the Asymmetric Postman Problem.

Balaji Raghavachari, Jeyakesavan Veerasamy

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

A Uniform Framework for Approximating Weighted Connectivity Problems.

Samir Khuller, Balaji Raghavachari, An Zhu

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Basic Graph Algorithms.

Samir Khuller, Balaji Raghavachari

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Advanced Combinatorial Algorithms.

Samir Khuller, Balaji Raghavachari

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Approximation Algorithms for the Mixed Postman Problem.

Balaji Raghavachari, Jeyakesavan Veerasamy

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

The Finite Capacity Dial-A-Ride Problem.

Moses Charikar, Balaji Raghavachari

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.

Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young

J. Algorithms, 1997

Graph and Network Algorithms.

Samir Khuller, Balaji Raghavachari

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

Low-Degree Spanning Trees of Small Weight.

Samir Khuller, Balaji Raghavachari, Neal E. Young

SIAM J. Comput., 1996

Parallel Edge Coloring Approximation.

Martin Fürer, Balaji Raghavachari

Parallel Process. Lett., 1996

Improved Approximation Algorithms for Uniform Connectivity Problems.

Samir Khuller, Balaji Raghavachari

J. Algorithms, 1996

On Strongly Connected Digraphs with Bounded Cycle Length.

Samir Khuller, Balaji Raghavachari, Neal E. Young

Discret. Appl. Math., 1996

Landmarks in Graphs.

Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld

Discret. Appl. Math., 1996

Graph and Network Algorithms.

Samir Khuller, Balaji Raghavachari

ACM Comput. Surv., 1996

1995

Approximating the Minimum Equivalent Digraph.

Samir Khuller, Balaji Raghavachari, Neal E. Young

SIAM J. Comput., 1995

An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.

Martin Fürer, Balaji Raghavachari

J. Algorithms, 1995

Balancing Minimum Spanning Trees and Shortest-Path Trees.

Samir Khuller, Balaji Raghavachari, Neal E. Young

Algorithmica, 1995

1994

Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs.

Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari

SIAM J. Discret. Math., 1994

Chaining Multiple-Alignment Blocks.

Zheng Zhang, Balaji Raghavachari, Ross C. Hardison, Webb Miller

J. Comput. Biol., 1994

Constructing Aligned Sequence Blocks.

Webb Miller, Mark Boguski, Balaji Raghavachari, Zheng Zhang, Ross C. Hardison

J. Comput. Biol., 1994

Approximating the Minimum-Degree Steiner Tree to within One of Optimal.

Martin Fürer, Balaji Raghavachari

J. Algorithms, 1994

Designing Multi-Commodity Flow Trees.

Samir Khuller, Balaji Raghavachari, Neal E. Young

Inf. Process. Lett., 1994

Approximating the Minimum Equivalent Diagraph.

Samir Khuller, Balaji Raghavachari, Neal E. Young

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Balancing Minimum Spanning and Shortest Path Trees.

Samir Khuller, Balaji Raghavachari, Neal E. Young

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992

O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs.

Martin Fürer, Xin He, Ming-Yang Kao, Balaji Raghavachari

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree.

Martin Fürer, Balaji Raghavachari

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Approximation Through Local Optimality: Designing Networks with Small Degree.

R. Ravi, Balaji Raghavachari, Philip N. Klein

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992