5BjzhtSBe5ShPT349qCDJzOSbOP07SqUVSBwDd3Q7Z6E6WWqJgwgDYg67kvY

Paper Publications

Home >> Scientific Research >> Paper Publications

Approximating Max k-Uncut via LP-rounding plus greed, with applications to Densest k-Subgraph(CCF-B)

Release Time:2021-05-28| Hits:

Institution:软件学院

Title of Paper:Approximating Max k-Uncut via LP-rounding plus greed, with applications to Densest k-Subgraph(CCF-B)

Journal:Theoretical Computer Science

First Author:张鹏

Document Code:0F6B768B6A6445FBAF9F67CED07E9AE6

Volume:849

Issue:1

Page Number:173

Number of Words:12

Translation or Not:No

Date of Publication:2021-01

Release Time:2021-05-28

Prev One:
A (1.4+epsilon)-approximation algorithm for the 2-MAX-DUO problem
Next One:
Minimum label s-t cut has large integrality gaps

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