Exact Approaches for the Connected Vertex Cover Problem
Author:
- 23 February 2024
- book chapter
- Published by Springer Nature
- p. 29-40
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Connected vertex covers in dense graphsTheoretical Computer Science, 2010
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphsJournal of Discrete Algorithms, 2010
- Vertex and edge covers with clustering properties: Complexity and algorithmsJournal of Discrete Algorithms, 2009
- The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex CoverSIAM Journal on Discrete Mathematics, 1998
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphsDiscrete Applied Mathematics, 1995
- Approximating the tree and tour covers of a graphInformation Processing Letters, 1993
- Using separation algorithms to generate mixed integer model reformulationsOperations Research Letters, 1991
- Depth-first search and the vertex cover problemInformation Processing Letters, 1982
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960