Complexity and approximability of minimum path-collection exact covers

DOI10.1016/j.tcs.2022.11.022OpenAlexW4310059448MaRDI QIDQ2110360

Cristina G. Fernandes, Santiago Valdés Ravelo

Publication date: 21 December 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.022

zbMATH Keywords

computational complexitycombinatorial optimizationpolynomial-time algorithmapproximabilityexact edge cover

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Clustering to minimize the maximum intercluster distance
• Minimum constellation covers: hardness, approximability and polynomial cases
• Graph Theory
• Scaling Algorithms for Weighted Matching in General Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity and approximability of minimum path-collection exact covers