A portfolio solver blending vertex cover kernelization with clique and maximum-independent-set techniques won PACE 2019, solving 87 of 100 private instances and revealing that kernelization can either boost or hurt branch-and-bound search.
Abu-Khzam, Michael R
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track
A portfolio solver blending vertex cover kernelization with clique and maximum-independent-set techniques won PACE 2019, solving 87 of 100 private instances and revealing that kernelization can either boost or hurt branch-and-bound search.