mZv0uhOoELK5PnIx8VvvVTXzw9NCWzVUeFZ9T3Aiu8MWr9Y1T1T1UXksx5ev
Current position: Home >> Scientific Research >> Paper Publications

PQ-树断点距离中心问题的复杂性和算法

Hits:

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

Title of Paper:PQ-树断点距离中心问题的复杂性和算法

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

First Author:姜海涛

Document Code:lw-185496

Translation or Not:No

Date of Publication:2016-03

Release Time:2019-04-14

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

Next One:Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem.

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