The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut
- 30 January 2019
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 256, 11-37
Abstract
No abstract availableKeywords
Funding Information
- FMJH Program PGMO
- ADF-THALES-ORANGE-CRITEO
This publication has 12 references indexed in Scilit:
- The $k$ k -separator problem: polyhedra, complexity and approximation resultsJournal of Combinatorial Optimization, 2014
- On the minimum cut separator problemNetworks, 2011
- An exact algorithm for solving the vertex separator problemJournal of Global Optimization, 2010
- Simple and Improved Parameterized Algorithms for Multiterminal CutsTheory of Computing Systems, 2009
- Parameterized graph separation problemsTheoretical Computer Science, 2006
- On the hardness of approximating vertex coverAnnals of Mathematics, 2005
- The vertex separator problem: a polyhedral investigationMathematical Programming, 2005
- The vertex separator problem: algorithms and computationsMathematical Programming, 2005
- Multiway cuts in node weighted graphsJournal of Algorithms, 2004
- A note on the complexity of Dijkstra's algorithm for graphs with weighted verticesIEEE Transactions on Computers, 1998