Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
This note presents improved approximation guarantees for the requirement cut problem: given an n-vertex edge-weighted graph G=(V,E), and g groups of vertices X1,...,Xg ⊆ V with each group Xi having a requirement ri between 0 and |Xi|, the goal is to find a minimum cost set of edges whose removal separates each group Xi into at least ri disconnected components. We give a tight Θ(logg) approximation ratio for this problem when the underlying graph is a tree, and show how this implies an O(logk·logg) approximation ratio for general graphs, where k=|∪gi=1=1gXi|≤n. © 2010 Elsevier B.V. All rights reserved.
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Minghong Fang, Zifan Zhang, et al.
CCS 2024