Greedy approximation algorithms for directed multicuts

DOI10.1002/net.20066zbMath1103.68985OpenAlexW4252201327MaRDI QIDQ5463671

Yana Kortsarts, Guy Kortsarz, Zeev Nutov

Publication date: 5 August 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20066

zbMATH Keywords

approximationmulticutsgraphsdirected

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (4)

On the advantage of overlapping clusters for minimizing conductance ⋮ The checkpoint problem ⋮ Quasimetric embeddings and their applications ⋮ An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Greedy approximation algorithms for directed multicuts