A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem

DOI10.1007/978-3-319-08783-2_30zbMath1423.68604OpenAlexW2217851835MaRDI QIDQ2920472

Peng Zhang

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_30

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem

This page was built for publication: A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem