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

DOI10.1016/J.ENDM.2004.03.027MaRDI QIDQ3439142zbMATH OpenOpenAlexFDO

Authors Takashi Doi, Toshihiro Fujito

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) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 1670541 (Why is no real title available?)
• scientific article; zbMATH DE number 3869066 (Why is no real title available?)
• scientific article; zbMATH DE number 2080196 (Why is no real title available?)
• A 2-approximation algorithm for the minimum weight edge dominating set problem
• Approximating the tree and tour covers of a graph
• Depth-first search and the vertex cover 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

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