Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem

From MaRDI portal
Revision as of 08:20, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:633844

DOI10.1007/S00453-009-9316-1zbMath1211.68515OpenAlexW2125472409MaRDI QIDQ633844

Mingyu Xiao, Andrew Chi-Chih Yao, Leizhen Cai

Publication date: 30 March 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9316-1




Related Items (5)




Cites Work




This page was built for publication: Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem