The following pages link to Balaji Raghavachari (Q1026236):
Displaying 43 items.
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems (Q1026237) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- Designing multi-commodity flow trees (Q1321837) (← links)
- (Q1372290) (redirect page) (← links)
- The e-mail gossip number and the connected domination number (Q1372291) (← links)
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139) (← links)
- Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
- On strongly connected digraphs with bounded cycle length (Q1923587) (← links)
- Survivable network design: the capacitated minimum spanning network problem (Q2390307) (← links)
- Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
- Landmarks in graphs (Q2563921) (← links)
- Algorithms for Capacitated Vehicle Routing (Q2784475) (← links)
- Low degree spanning trees of small weight (Q2817632) (← links)
- Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design (Q2944499) (← links)
- (Q3140426) (← links)
- Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem (Q3596353) (← links)
- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity (Q3603513) (← links)
- (Q3840356) (← links)
- (Q4036583) (← links)
- (Q4234045) (← links)
- (Q4246713) (← links)
- (Q4247262) (← links)
- (Q4252354) (← links)
- (Q4252419) (← links)
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal (Q4314499) (← links)
- Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs (Q4317708) (← links)
- An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (Q4327819) (← links)
- (Q4335208) (← links)
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134) (← links)
- (Q4471364) (← links)
- (Q4474221) (← links)
- (Q4542553) (← links)
- Approximation algorithms for finding low-degree subgraphs (Q4651931) (← links)
- A 3/2-Approximation Algorithm for the Mixed Postman Problem (Q4699169) (← links)
- (Q4763417) (← links)
- Approximating the Minimum Equivalent Digraph (Q4852628) (← links)
- Low-Degree Spanning Trees of Small Weight (Q4877523) (← links)
- Improved Approximation Algorithms for Uniform Connectivity Problems (Q4895812) (← links)
- Designing multi-commodity flow trees (Q5060134) (← links)
- Algorithm Theory - SWAT 2004 (Q5315385) (← links)
- Automata, Languages and Programming (Q5466515) (← links)
- LATIN 2004: Theoretical Informatics (Q5901641) (← links)
- LATIN 2004: Theoretical Informatics (Q5901662) (← links)
