8mPS2H8yTCLd599Y3XU8RfiYNhxzGsZfOFhC2IYujZaplWSuid0571kzK4Ql

Paper Publications

Home >> Scientific Research >> Paper Publications

A new approximation algorithm for the unbalanced min s-t cut problem

Release Time:2019-04-14| Hits:

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

Title of Paper:A new approximation algorithm for the unbalanced min s-t cut problem

Journal:Theoretical Computer Science

First Author:张鹏

Document Code:lw-181085

Translation or Not:No

Date of Publication:2016-08

Release Time:2019-04-14

Prev One:
The label cut problem with respect to path length and label frequency
Next One:
Improved approximation algorithms for the maximum happy vertices and edges 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: --