RH6QMbbrfxUCN4p8baySobSWiLIQj1ONedfaAXTSCPZnMfyuWhREPeXmpGbg

Paper Publications

Home >> Scientific Research >> Paper Publications

Approximation and hardness results for the max k-uncut problem(CCF-B)

Release Time:2019-10-25| Hits:

Institution:软件学院

Title of Paper:Approximation and hardness results for the max k-uncut problem(CCF-B)

Journal:Theoretical Computer Science

First Author:张鹏

All the Authors:Peng Zhang

Document Code:BB4295D0E8E64916BD4252918B010C3B

Volume:749

Issue:1

Page Number:47

Number of Words:8

Translation or Not:No

Date of Publication:2018-11

Release Time:2019-10-25

Prev One:
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems(CCF-B)
Next One:
Simpler and better approximation algorithms for the unweighted label s-t cut problem（CCF-B）

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