Barun Chandra

According to our database, Barun Chandra authored at least 9 papers between 1992 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2001

Greedy Local Improvement and Weighted Set Packing Approximation.

Barun Chandra, Magnús M. Halldórsson

J. Algorithms, 2001

Approximation Algorithms for Dispersion Problems.

Barun Chandra, Magnús M. Halldórsson

J. Algorithms, 2001

1999

New Results on the Old k-opt Algorithm for the Traveling Salesman Problem.

Barun Chandra, Howard J. Karloff, Craig A. Tovey

SIAM J. Comput., 1999

1996

Facility Dispersion and Remote Subgraphs.

Barun Chandra, Magnús M. Halldórsson

Proceedings of the Algorithm Theory, 1996

1995

Constructing Reliable Communication Networks of Small Weight Online.

Barun Chandra, Sundar Vishwanathan

J. Algorithms, 1995

New sparseness results on graph spanners.

Barun Chandra, Gautam Das, Giri Narasimhan, José Soares

Int. J. Comput. Geom. Appl., 1995

1994

Constructing Sparse Spanners for Most Graphs in Higher Dimensions.

Barun Chandra

Inf. Process. Lett., 1994

New Results on the Old k-Opt Algorithm for the TSP.

Barun Chandra, Howard J. Karloff, Craig A. Tovey

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

1992

Does Randomization Help in On-Line Bin Packing?

Barun Chandra

Inf. Process. Lett., 1992