The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness

DOI10.1007/978-3-319-45587-7_28zbMath1452.90275OpenAlexW2513220791MaRDI QIDQ2835687

Sébastien Martin, Youcef Magnouche

Publication date: 30 November 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_28

zbMATH Keywords

combinatorial optimizationtotal dual integralityvertex separator problempolytope characterization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• An exact algorithm for solving the vertex separator problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• An improved parameterized algorithm for the minimum node multiway cut problem
• The vertex separator problem: a polyhedral investigation
• On Multiway Cut Parameterized above Lower Bounds
• On the minimum cut separator problem
• Multiway cuts in node weighted graphs
• The k-Separator Problem

This page was built for publication: The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness