On cutting a few vertices from a graph
From MaRDI portal
Publication:1811082
DOI10.1016/S0166-218X(02)00394-3zbMath1019.68137MaRDI QIDQ1811082
Kobbi Nissim, Robert Krauthgamer, Uriel Feige
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90C39: Dynamic programming
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems, Heuristics for the data arrangement problem on regular trees, A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem, Parameterized complexity of immunization in the threshold model, Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization, Unbalanced graph cuts with minimum capacity
Cites Work