Return Home
Paper Publications
Approximating Max k-Uncut via LP-rounding plus greed, with applications to Densest k-Subgraph(CCF-B)
  • Affiliation of Author(s):
    软件学院
  • Journal:
    Theoretical Computer Science
  • First Author:
    张鹏
  • Document Code:
    0F6B768B6A6445FBAF9F67CED07E9AE6
  • Volume:
    849
  • Issue:
    1
  • Page Number:
    173
  • Number of Words:
    12
  • 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