( en | de | ru )

 

Disambiguation of "Raghavachari, Balaji"

Author of the publication

copydeleteadd this publication to your clipboard
Approximation Through Local Optimality: Designing Networks with Small Degree.

, , and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 279-290. Springer, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Balaji Samikannu

Hari Balaji

Balaji Birajdar

Balaji Palanisamy

Balaji Olety Amaranath

 

Other publications of authors with the same name

Balancing Minimum Spanning and Shortest Path Trees., , and . SODA, page 243-250. ACM/SIAM, (1993)Approximating the Minimum Equivalent Diagraph., , and . SODA, page 177-186. ACM/SIAM, (1994)A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees., , , , and . J. Algorithms, 24 (2): 310-324 (1997)Designing Multi-Commodity Flow Trees., , and . Inf. Process. Lett., 50 (1): 49-55 (1994)Improved approximation algorithms for the single-sink buy-at-bulk network design problems., and . J. Discrete Algorithms, 7 (2): 249-255 (2009)Graph Connectivity., and . Encyclopedia of Algorithms, (2016)O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs., , , and . SPAA, page 410-419. ACM, (1992)Greedy Methods., , and . Handbook of Approximation Algorithms and Metaheuristics (1), Chapman and Hall/CRC, (2018)Basic Graph Algorithms., and . Algorithms and Theory of Computation Handbook, CRC Press, (1999)Low-Degree Spanning Trees of Small Weight., , and . SIAM J. Comput., 25 (2): 355-368 (1996)