English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

As a judicious correspondence to the classical maxcut, the anti-Cheeger cuthas more balanced structure, but few numerical results on it have been reportedso far. In this paper, we propose a continuous iterative algorithm for theanti-Cheeger cut problem through fully using an equivalent continuousformulation. It does not need rounding at all and has advantages that allsubproblems have explicit analytic solutions, the objection function values aremonotonically updated and the iteration points converge to a local optima infinite steps via an appropriate subgradient selection. It can also be easilycombined with the maxcut iterations for breaking out of local optima andimproving the solution quality thanks to the similarity between theanti-Cheeger cut problem and the maxcut problem. Numerical experiments on G-setdemonstrate the performance.

Continuous iterative algorithms for anti-Cheeger cut