kk538dsAlWaMDHaa9nlybbrQWrcsJDGbgvCMRg64fDFPijewE6mdmAugxlmt
zhudaming

Personal Information

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

VIEW MORE
Home > Scientific Research > Paper Publications

Complexity and approximation results for the min-sum and min-max disjoint paths problems

Release Time:2019-04-14 Hits:

Institution:计算机科学与技术学院
Journal:Computing and Informatics
First Author:张鹏
All the Authors:朱大铭
Document Code:lw-148564
Volume:32
Issue:1
Page Number:23
Translation or Not:No
Date of Publication:2013-02

Prev One:A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations.

Next One:An improved approximation algorithm for scaffold filling to maximize the common adjacencies

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