0txC8skri2depWwnAMHgSaQBd69etz5fPG7Yaxx0itSJYl5zwEV35uIHvoJI

Paper Publications

Home >> Scientific Research >> Paper Publications

Approximating max k-uncut via LP-rounding plus greed, with applications to densest k-subgraph

Release Time:2021-05-31| Hits:

Institution:软件学院

Title of Paper:Approximating max k-uncut via LP-rounding plus greed, with applications to densest k-subgraph

Journal:The 14th International Conference of Algorithmic Aspects in Information and Management

First Author:张鹏

Document Code:1BF9534D3AA540A9A17E087DDA3640B1

Number of Words:7

Translation or Not:No

Date of Publication:2020-08

Release Time:2021-05-31

Prev One:
Minimum Label s-t Cut has large integrality gaps（CCF-A）
Next One:
Unbalanced Graph Partitioning

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