Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/wob/CunhaKHF13
%A Cunha, Luís Felipe I.
%A Kowada, Luis Antonio Brasil
%A de A. Hausen, Rodrigo
%A de Figueiredo, Celina M. H.
%B BSB
%D 2013
%E Setubal, João C.
%E Almeida, Nalvo F.
%I Springer
%K dblp
%P 126-135
%T On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time.
%U http://dblp.uni-trier.de/db/conf/wob/bsb2013.html#CunhaKHF13
%V 8213
%@ 978-3-319-02623-7
@inproceedings{conf/wob/CunhaKHF13,
added-at = {2019-10-19T00:00:00.000+0200},
author = {Cunha, Luís Felipe I. and Kowada, Luis Antonio Brasil and de A. Hausen, Rodrigo and de Figueiredo, Celina M. H.},
biburl = {https://www.bibsonomy.org/bibtex/207c8d05289f30de17993b14d94032eb9/dblp},
booktitle = {BSB},
crossref = {conf/wob/2013},
editor = {Setubal, João C. and Almeida, Nalvo F.},
ee = {https://doi.org/10.1007/978-3-319-02624-4_12},
interhash = {1bb9bfec558eb2e0f9c87f3ef9ece0e7},
intrahash = {07c8d05289f30de17993b14d94032eb9},
isbn = {978-3-319-02623-7},
keywords = {dblp},
pages = {126-135},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-10-22T14:23:30.000+0200},
title = {On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time.},
url = {http://dblp.uni-trier.de/db/conf/wob/bsb2013.html#CunhaKHF13},
volume = 8213,
year = 2013
}