Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation

El Ouali, Mourad and Sauerland, Volkmar (2013) Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, 8288 . pp. 443-447. DOI 10.1007/978-3-642-45278-9_40.

Full text not available from this repository.

Supplementary data:

Document Type: Article
Research affiliation: Kiel University > Kiel Marine Science
OceanRep > The Future Ocean - Cluster of Excellence
Kiel University
Refereed: Yes
DOI etc.: 10.1007/978-3-642-45278-9_40
ISSN: 0302-9743
Projects: Future Ocean
Date Deposited: 03 Apr 2018 09:51
Last Modified: 05 Apr 2018 09:46
URI: http://eprints.uni-kiel.de/id/eprint/42578

Actions (login required)

View Item View Item