activity
20172026
most citedSmaller extended formulations for spanning tree polytopes in minor-closed classes and beyond

7 citations · 12 across the 12 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2022

Exact approaches for the Connected Vertex Cover problem

Manuel Aprile

Given a graph , the Connected Vertex Cover problem (CVC) asks to find a minimum cardinality vertex cover of that induces a connected subgraph. In this paper we describe some…