Preface of STACS 2012 Special Issue

Christoph Dürr, Thomas Wilke
2014 Theory of Computing Systems  
These extended abstracts were among the top papers of those that were chosen for presentation at STACS 2012 in a highly competitive peer-review process (after which only 54 papers out of 274 submission were accepted). Compared with the original extended abstracts the articles have been extended by full proofs and additional results. They underwent a further rigorous reviewing process, following the TOCS standard, completely independent from the selection process of STACS 2012. The topics of the
more » ... papers cover data structures, approximation algorithms, compressed data, languages and logic. The article 13/9-approximation for the Graphic TSP by Marcin Mucha improves the analysis of an approximation algorithm for the traveling salesman problem (TSP) for graphic metrics, which received considerable attention in the last year. Improving the bound of a circulation in a network arising in the analysis, he succeeds to show the ratio 13/9 for the TSP and the ratio 19/12 for the traveling salesman path problem in graphic metrics.
doi:10.1007/s00224-013-9530-8 fatcat:735tiimi7jax7nxaupttepgxlu