上一条:Approximating Max k-Uncut via LP-rounding plus greed, with applications to Densest k-Subgraph
下一条:An approximation algorithm for genome sorting by reversals to recover all adjacencies