A1Nq3a0AozmEfWpLQM1L2LvpKXbx9BVL9elNg9y0Un9YOwCnheSNyrqRSjui

Paper Publications

Home >> Scientific Research >> Paper Publications

Simpler and better approximation algorithms for the unweighted label s-t cut problem（CCF-B）

Release Time:2019-10-25| Hits:

Institution:软件学院

Title of Paper:Simpler and better approximation algorithms for the unweighted label s-t cut problem（CCF-B）

Journal:Algorithmica

First Author:张鹏

All the Authors:Peng Zhang

Document Code:019918FAC1C94EBDAD872020A3EB2B64

Volume:80

Issue:1

Page Number:398

Number of Words:8

Translation or Not:No

Date of Publication:2018-01

Release Time:2019-10-25

Prev One:
Approximation and hardness results for the max k-uncut problem(CCF-B)
Next One:
Complexity and approximation results for the min-sum and min-max disjoint paths problems

中文    |   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: --