Approximation algorithms for multi-multiway cut and multicut problems on directed graphs
In this paper, we study the directed multicut and directed multimultiway cut problems. The input to the directed multi-multiway cut problem is a weighted directed graph $G=(V,E)$ and $k$ sets $S_1, S_2,\cdots, S_k$ of vertices. The goal is to find a subset of edges of minimum total weight whose remo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Amirkabir University of Technology
2020-09-01
|
| Series: | AUT Journal of Mathematics and Computing |
| Subjects: | |
| Online Access: | https://ajmc.aut.ac.ir/article_3810_a98e4fa1a61303bf95d323742515901d.pdf |