Approximation algorithms for generalized bounded tree cover
DOI10.1007/978-3-319-30139-6_21zbMATH Open1475.68244OpenAlexW2486840771MaRDI QIDQ2803829FDOQ2803829
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
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
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)
Cites Work
- Min-max tree covers of graphs.
- Approximation algorithms for distance constrained vehicle routing problems
- Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs
- On Clustering on Graphs with Multiple Edge Types
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Approximations for minimum and min-max vehicle routing problems
- Approximation Algorithms for Min–Max Tree Partition
Cited In (7)
- How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover
- Approximating the minmax rooted-tree cover in a tree
- Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
- Approximating the tree and tour covers of a graph
- Approximation algorithms for metric tree cover and generalized tour and tree covers
- Forward bounding on pseudo-trees for DCOPs and ADCOPs
- Title not available (Why is that?)
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)
