A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals

For an undirected edge-weighted graph $G$ and a set $R$ of pairs of vertices called pairs of terminals, a multicut is a set of edges such that removing these edges from $G$ disconnects each pair in $R$. We provide an algorithm computing a $(1+\varepsilon)$-approximation of the minimum multicut of a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing 2021-01, Vol.50 (1), p.1-31
Hauptverfasser:	Cohen-Addad, Vincent, Colin de Verdière, Éric, de Mesmay, Arnaud
Format:	Artikel
Sprache:	eng
Schlagworte:	Computational Geometry Computer Science Data Structures and Algorithms Geometric Topology Mathematics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!