Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem

DOI10.1007/s00453-016-0265-1zbMath1386.68224MaRDI QIDQ1702134

Peng Zhang, Bin Fu, Lin-Qing Tang

Publication date: 28 February 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0265-1

zbMATH Keywords

shortest path; minimum cut; approximation algorithms; label cut

Mathematics Subject Classification ID

90C27: Combinatorial optimization

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms