O(nlogn) Time.">O(nlogn) Time., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in ..."

Jesun Sahariar Firoz et al. (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-11440-3_15

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/walcom/FirozHKR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/walcom/FirozHKR10
Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman:
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. WALCOM 2010: 161-166

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.