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

DOI10.1016/J.ENDM.2004.03.027zbMATH Open1152.90632OpenAlexW2181170156MaRDI QIDQ3439142FDOQ3439142

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

• Depth-first search and the vertex cover problem
• Title not available (Why is that?)
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• A 2-approximation algorithm for the minimum weight edge dominating set problem
• Approximating the tree and tour covers of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)

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)