Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
From MaRDI portal
Publication:3525807
DOI10.1007/11682462_68zbMath1145.90458OpenAlexW1540794569MaRDI QIDQ3525807
Publication date: 18 September 2008
Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11682462_68
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
On the approximation ability of evolutionary optimization with application to minimum set cover ⋮ A distributed approximation algorithm for the minimum degree minimum weight spanning trees
This page was built for publication: Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization