The $k$ k -separator problem: polyhedra, complexity and approximation results
- 15 May 2014
- journal article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 29 (1) , 276-307
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graphJournal of Discrete Algorithms, 2008
- Independent packings in structured graphsMathematical Programming, 2005
- On the hardness of approximating vertex coverAnnals of Mathematics, 2005
- The vertex separator problem: a polyhedral investigationMathematical Programming, 2005
- The primal-dual method for approximation algorithmsMathematical Programming, 2002
- Maximum weight independent sets and cliques in intersection graphs of filamentsInformation Processing Letters, 2000
- k-edge subgraph problemsDiscrete Applied Mathematics, 1997
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphsAlgorithmica, 1995
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- On graphs with polynomially solvable maximum‐weight clique problemNetworks, 1989