Approximating the minmax subtree cover problem in a cactus

DOI10.1007/978-3-540-30551-4_61MaRDI QIDQ5712159zbMATH OpenOpenAlexFDO

Authors Hiroshi Nagamochi, Taizo Kawada

Publication date 22 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104582

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Minmax subtree cover problem on cacti
• Algorithms and Computation
• Approximating the minmax rooted-tree cover in a tree
• 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

Cited in

(6)

• Exact approaches for solving a covering problem with capacitated subtrees
• Approximate spanning cactus
• On the \(k\)-path cover problem for cacti
• Minmax subtree cover problem on cacti
• Algorithms and Computation
• Maximum max-k-clique subgraphs in cactus subtree graphs

This page was built for publication: Approximating the minmax subtree cover problem in a cactus

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