0o8e5TRuR8fn4D7q3vL6kbZLLoHE3rGVOs42mRm7pfvkWIfwxP7QIvpuKOqp

Paper Publications

Home >> Scientific Research >> Paper Publications

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

Release Time:2019-10-24| Hits:

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

Title of Paper:Complexity and approximation results for the min-sum and min-max disjoint paths problems

Journal:Computing and Informatics

First Author:张鹏

All the Authors:朱大铭,Peng Zhang

Document Code:lw-148564

Volume:32

Issue:1

Page Number:23

Number of Words:15

Translation or Not:No

Date of Publication:2013-02

Release Time:2019-10-24

Prev One:
Simpler and better approximation algorithms for the unweighted label s-t cut problem（CCF-B）
Next One:
Approximating minimum label s-t cut via linear programming

中文    |   MOBILE Version   |   Login   |   SDU   

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

The Open Time: --

The Last Update Time: --