Spanning closed walks and TSP in 3-connected planar graphs

Ken-ichi Kawarabayashi, Kenta Ozeki. Spanning closed walks and TSP in 3-connected planar graphs. In Yuval Rabani, editor, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012. pages 671-682, SIAM, 2012. [doi]

@inproceedings{KawarabayashiO12,
  title = {Spanning closed walks and TSP in 3-connected planar graphs},
  author = {Ken-ichi Kawarabayashi and Kenta Ozeki},
  year = {2012},
  url = {http://portal.acm.org/citation.cfm?id=2095172&CFID=63838676&CFTOKEN=79617016},
  researchr = {https://researchr.org/publication/KawarabayashiO12},
  cites = {0},
  citedby = {0},
  pages = {671-682},
  booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012},
  editor = {Yuval Rabani},
  publisher = {SIAM},
}