Approximating max k-uncut via LP-rounding plus greed, with applications to densest k-subgraph
Affiliation of Author(s):
软件学院
First Author:
张鹏
Document Code:
1BF9534D3AA540A9A17E087DDA3640B1
Number of Words:
7
Translation or Not:
no
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
