Balaji Raghavachari

Available identifiers

zbMath Open raghavachari.balajiMaRDI QIDQ1026236

List of research outcomes

Publication	Date of Publication	Type
Designing multi-commodity flow trees	2023-01-18	Paper
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees	2019-01-11	Paper
Low degree spanning trees of small weight	2016-09-01	Paper
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design	2015-09-02	Paper
Survivable network design: the capacitated minimum spanning network problem	2009-07-21	Paper
Degree-bounded minimum spanning trees	2009-06-30	Paper
Improved approximation algorithms for the single-sink buy-at-bulk network design problems	2009-06-24	Paper
LATIN 2004: Theoretical Informatics	2009-05-07	Paper
LATIN 2004: Theoretical Informatics	2009-05-07	Paper
A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity	2009-02-17	Paper
Approximating the \(k\)-traveling repairman problem with repair times	2007-10-30	Paper
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem	2007-08-30	Paper
Algorithm Theory - SWAT 2004	2005-09-07	Paper
Automata, Languages and Programming	2005-08-24	Paper
Approximation algorithms for finding low-degree subgraphs	2005-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q4474221	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4471364	2004-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4542553	2002-08-01	Paper
Algorithms for Capacitated Vehicle Routing	2002-04-23	Paper
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem	2000-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q4234045	2000-08-03	Paper
https://portal.mardi4nfdi.de/entity/Q4247262	2000-01-18	Paper
A 3/2-Approximation Algorithm for the Mixed Postman Problem	1999-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4252354	1999-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4252419	1999-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4246713	1999-06-16	Paper
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees	1998-09-20	Paper
https://portal.mardi4nfdi.de/entity/Q3840356	1998-08-10	Paper
The e-mail gossip number and the connected domination number	1998-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4335208	1997-08-03	Paper
Landmarks in graphs	1997-07-07	Paper
On strongly connected digraphs with bounded cycle length	1997-04-07	Paper
Low-Degree Spanning Trees of Small Weight	1996-11-03	Paper
Improved Approximation Algorithms for Uniform Connectivity Problems	1996-10-16	Paper
Balancing minimum spanning trees and shortest-path trees	1996-03-11	Paper
Approximating the Minimum-Degree Steiner Tree to within One of Optimal	1995-11-22	Paper
Approximating the Minimum Equivalent Digraph	1995-11-01	Paper
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs	1995-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q4763417	1995-04-11	Paper
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs	1994-12-20	Paper
Designing multi-commodity flow trees	1994-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q3140426	1994-01-02	Paper
https://portal.mardi4nfdi.de/entity/Q4036583	1993-05-18	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Balaji Raghavachari