Approximation algorithms for generalized bounded tree cover

DOI10.1007/978-3-319-30139-6_21MaRDI QIDQ2803829zbMATH OpenOpenAlexFDO

Authors Barun Gorain, P. S. Mandal, 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

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

Recommendations

• Generalized bounded tree cover of a graph
• Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• Approximation algorithms for metric tree cover and generalized tour and tree covers
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

Cites work

• Approximation Algorithms for Min–Max Tree Partition
• Approximation algorithms for distance constrained vehicle routing problems
• Approximations for minimum and min-max vehicle routing problems
• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• Min-max tree covers of graphs.
• On clustering on graphs with multiple edge types
• Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs

Cited in

(9)

• Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
• Generalized bounded tree cover of a graph
• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• Approximating the tree and tour covers of a graph
• Approximating the minmax rooted-tree cover in a tree
• Approximation algorithms for metric tree cover and generalized tour and tree covers
• How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover
• Forward bounding on pseudo-trees for DCOPs and ADCOPs
• scientific article; zbMATH DE number 6292624 (Why is no real title available?)

This page was built for publication: Approximation algorithms for generalized bounded tree cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803829)