The k-Separator Problem

DOI10.1007/978-3-642-38768-5_31zbMath1381.90090OpenAlexW192578035MaRDI QIDQ4925250

José Neto, Mohamed-Ahmed Mohamed-Sidi, Walid Ben-Ameur

Publication date: 11 June 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_31

zbMATH Keywords

optimizationcommunication networksgraph partitioningapproximation algorithmscomplexity theory

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

The multi-terminal vertex separator problem: branch-and-cut-and-price ⋮ Unnamed Item ⋮ The vertex \(k\)-cut problem ⋮ On integer and bilevel formulations for the \(k\)-vertex cut problem ⋮ The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut ⋮ On the computational complexity of vertex integrity and component order connectivity ⋮ The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness ⋮ The \(k\)-separator problem: polyhedra, complexity and approximation results

This page was built for publication: The k-Separator Problem