CTJmu9quZo7lMMqAgVGBZPMLcMGXvw9fVrRv6QbCrTAqUOJvwg9SjWBzaN6c
zhudaming

Personal Information

Gender:Male
Date of Employment:1990-07-01

VIEW MORE
Home > Scientific Research > Paper Publications

A (1+e)-approximation algorithm for sorting by short block-moves

Release Time:2019-04-14 Hits:

Institution:计算机科学与技术学院
Journal:Theoretical Computer Science
First Author:姜海涛
All the Authors:朱大铭
Document Code:lw-140857
Volume:439
Page Number:1
Translation or Not:No
Date of Publication:2012-06

Prev One:An approximation algorithm for the generalized k-multicut problem

Next One:Can a permutation be sorted by best short swaps?

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:  | The Last Update Time:..  | Login | SDU