Light Spanner and Monotone Tree
arXiv:1207.3807 · doi:10.1007/978-3-642-32589-2_42
Abstract
In approximation algorithm design, light spanners has applications in graph-metric problems such as metric TSP (the traveling salesman problem). We have developed an efficient algorithm for light spanners in bounded pathwidth graphs, based on an intermediate data structure called monotone tree. In this paper, we extended the results to include bounded catwidth graphs.
arXiv admin note: text overlap with arXiv:1104.4669