Greedy approximation algorithms for directed multicuts

DOI10.1002/NET.20066MaRDI QIDQ5463671zbMATH OpenOpenAlexFDO

Authors 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

approximationdirectedgraphsmulticuts

Mathematics Subject Classification ID

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

Recommendations

• Approximation and Online Algorithms
• scientific article; zbMATH DE number 2079369
• Approximation Algorithms for Steiner and Directed Multicuts
• Simple and fast rounding algorithms for directed and node-weighted multiway cut
• Approximating directed multicuts

Cited in

(10)

• An O( n)-approximation algorithm for directed sparsest cut
• Approximating minimum feedback sets and multicuts in directed graphs
• Quasimetric embeddings and their applications
• Approximating directed multicuts
• Approximation Algorithms for Steiner and Directed Multicuts
• scientific article; zbMATH DE number 2079369 (Why is no real title available?)
• Approximating multicut and the demand graph
• On the advantage of overlapping clusters for minimizing conductance
• Approximation and Online Algorithms
• The checkpoint problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463671)