Scalable IP formulations for optimal vertex elimination allow heuristic benchmarking on medium graphs and deliver a parameterized approximation algorithm plus first lower bounds.
PhD thesis, Dresden University of Technology, Germany, 1999
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
Scalable IP formulations for optimal vertex elimination allow heuristic benchmarking on medium graphs and deliver a parameterized approximation algorithm plus first lower bounds.