Approximation algorithm for directed multicuts

DOI10.1007/978-3-540-31833-0_7MaRDI QIDQ5713449zbMATH OpenOpenAlexFDO

Authors Yana Kortsarts, Guy Kortsarz, Zeev Nutov

Publication date 14 December 2005

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

Full work available at URL https://doi.org/10.1007/b106130

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Greedy approximation algorithms for directed multicuts
• scientific article; zbMATH DE number 2079369
• Approximation Algorithms for Steiner and Directed Multicuts
• Approximation algorithms for feasible cut and multicut problems
• Approximating directed multicuts

Cited in

(15)

• An O( n)-approximation algorithm for directed sparsest cut
• Approximating -cuts with the vertex method
• Approximating minimum feedback sets and multicuts in directed graphs
• Approximating directed multicuts
• Combinatorial approximation algorithms for the maximum directed cut problem
• A 2-approximation algorithm for the directed multiway cut problem
• Hardness of cut problems in directed graphs
• Approximation Algorithms for Steiner and Directed Multicuts
• \(O(\sqrt{\log n})\) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems
• scientific article; zbMATH DE number 2079369 (Why is no real title available?)
• Approximating multicut and the demand graph
• Greedy approximation algorithms for directed multicuts
• Finding and using directed cuts of real graphs of algorithms
• Approximation algorithms for feasible cut and multicut problems
• Approximation algorithms for the Bipartite Multicut problem

This page was built for publication: Approximation algorithm for directed multicuts

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