Approximability of Connected Factors

DOI10.1007/978-3-319-08001-7_11zbMath1383.68096arXiv1310.2387OpenAlexW1746024445WikidataQ62044134 ScholiaQ62044134MaRDI QIDQ3188871

C. S. Rahul, N. S. Narayanaswamy, Kamiel Cornelissen, Bodo Manthey, Ruben Hoeksma

Publication date: 2 September 2014

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.2387

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Approximation and Exact Algorithms for Special Cases of Connected f-Factors ⋮ On the complexity landscape of connected \(f\)-factor problems ⋮ Approximation algorithms for connected graph factors of minimum weight

This page was built for publication: Approximability of Connected Factors