A Primal-Dual Method for Approximating Tree Cover with Two Weights

DOI10.1016/j.endm.2004.03.027zbMath1152.90632OpenAlexW2181170156MaRDI QIDQ3439142

Toshihiro Fujito, Takashi Doi

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.027

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the tree and tour covers of a graph
• Depth-first search and the vertex cover problem
• A 2-approximation algorithm for the minimum weight edge dominating set problem
• The Rectilinear Steiner Tree Problem is $NP$-Complete

This page was built for publication: A Primal-Dual Method for Approximating Tree Cover with Two Weights