scientific article; zbMATH DE number 1182761

zbMATH Open0908.90258MaRDI QIDQ4400844FDOQ4400844

Authors: Reuven Bar-Yehuda 

Publication date: 2 August 1998

Title of this publication is not available (Why is that?)

Recommendations

• One for the price of two: a unified approach for approximating covering problems
• scientific article; zbMATH DE number 1754596
• A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach
• Approximation algorithms for partial covering problems

zbMATH Keywords

approximation algorithmsvertex coverfeedback vertex setcovering problemslocal-ratio theoremgeneralized Steiner forest

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (5)

• Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
• Combinatorial algorithms for feedback problems in directed graphs
• One for the price of two: a unified approach for approximating covering problems
• Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost

This page was built for publication:

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