scientific article; zbMATH DE number 1445320
From MaRDI portal
Publication:4952635
zbMath0956.68108MaRDI QIDQ4952635
Publication date: 10 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs ⋮ Randomized approximation of the stable marriage problem ⋮ On the multi-radius cover problem ⋮ Node-weighted Steiner tree approximation in unit disk graphs ⋮ From causes for database queries to repairs and model-based diagnosis and back ⋮ A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem ⋮ Improved approximation algorithms for path vertex covers in regular graphs ⋮ Approximating the dense set-cover problem ⋮ On Constant Time Approximation of Parameters of Bounded Degree Graphs ⋮ An approximation algorithm for the partial vertex cover problem in hypergraphs ⋮ Wireless capacity with arbitrary gain matrix ⋮ A randomised approximation algorithm for the hitting set problem ⋮ A new approach for approximating node deletion problems ⋮ An improved approximation algorithm for vertex cover with hard capacities
This page was built for publication:
