#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1992

2006

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
- Int. J. Comput. Geometry Appl.
- 1992

Let <italic>G</italic>=(<italic>V,E</italic>) be an <italic>n</italic>-vertex connected graph with positive edge weights. A subgraph <italic>G</italic>′ = (<italic>V,E</italic>′) is a <italic>t-spanner</italic> of <italic>G</italic> if for all <italic>u, v ε V</italic>,the weighted distance between <italic>u</italic> and <italic>v</italic>… (More)

- Barun Chandra, Magnús M. Halldórsson
- SODA
- 1999

Given a collection of weighted sets, each containing at most k elements drawn from a finite base set, the kset packing problem is to find a maximum weight subcollection of disjoint sets. A greedy algorithm for this problem approximates it to within a factor of k, and natural local search has been shown to approximate it to within a factor of roughly k 1.… (More)

- Barun Chandra, Magnús M. Halldórsson
- J. Algorithms
- 2001

- Barun Chandra, Howard J. Karloff, Craig A. Tovey
- SIAM J. Comput.
- 1999

- Barun Chandra, Howard J. Karloff, Craig A. Tovey
- SODA
- 1994

Local search with k change neighborhoods is perhaps the oldest and most widely used heuristic method for the traveling salesman problem yet almost no theoretical performance guarantees for it were previously known This paper develops several results some worst case and some probabilistic on the performance of and k opt local search for the TSP with respect… (More)

- Barun Chandra, Magnús M. Halldórsson
- SWAT
- 1996

- Barun Chandra
- Inf. Process. Lett.
- 1992

- Barun Chandra
- Inf. Process. Lett.
- 1994

- Barun Chandra, Sundar Vishwanathan
- J. Algorithms
- 1995

- Barun Chandra, Howard Karloff, Craig Tovey
- SODA '94
- 1994

Local search with k-change neighborhoods is perhaps the oldest and most widely used heuristic method for the traveling salesman problem, yet very few theoretical performance guarantees for it were previously known. This paper develops several results, some worst-case and some probabilistic, on the performance of 2and k-opt local search for the TSP, with… (More)