Approximation Algorithms for Generalized Bounded Tree Cover

DOI10.1007/978-3-319-30139-6_21zbMath1475.68244OpenAlexW2486840771MaRDI QIDQ2803829

Partha Sarathi Mandal, Barun Gorain, Krishnendu Mukhopadhyaya

Publication date: 3 May 2016

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30139-6_21

zbMATH Keywords

TSPapproximation algorithmstree cover\(k\)-MST

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)

Cites Work

• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• Min-max tree covers of graphs.
• Approximation algorithms for distance constrained vehicle routing problems
• Saving an epsilon
• Approximation Algorithms for Min–Max Tree Partition
• On Clustering on Graphs with Multiple Edge Types
• Approximations for minimum and min-max vehicle routing problems

This page was built for publication: Approximation Algorithms for Generalized Bounded Tree Cover