1I4R3Na8EfOhZzat9zRkxsE0pHE995dIHAoAYzIERo8Iw4ziYAEJyepojJha
Current position: Home >> Scientific Research >> Paper Publications

排列短块移动排序距离的新下界

Hits:

Institution:计算机科学与技术学院

Title of Paper:排列短块移动排序距离的新下界

Journal:《计算机研究与发展》

First Author:姜海涛

All the Authors:姜海涛

Document Code:lw-185497

Translation or Not:No

Date of Publication:2015-11

Release Time:2019-10-24

Prev One:Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold Filling

Next One:A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs

Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Information desk: (86) - 0531-88395114
On Duty Telephone: (86) - 0531-88364731 Construction and Maintenance: Information Work Office of Shandong University

Click:Times MOBILE Version
The Founding Time : ..
The Last Update Time : ..

Mobile phone sweep