Extended spanning star forest problems

DOI10.1007/978-3-319-71150-8_18zbMath1470.68062OpenAlexW2768915115MaRDI QIDQ1699782

Dirk Oliver Theis, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Kaveh Khoshkhah

Publication date: 26 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_18

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Complexity and approximability of extended spanning star forest problems in general and complete graphs ⋮ Weighted Upper Edge Cover: Complexity and Approximability

This page was built for publication: Extended spanning star forest problems