Approximating V<scp>ertex</scp> C<scp>over</scp> using Structural Rounding

DOI10.1137/1.9781611976007.6MaRDI QIDQ5147498zbMATH OpenOpenAlexFDO

Authors Brian Lavallee, Hayley Russell, Andrew van der Poel, Blair D. Sullivan

Publication date 27 January 2021

Published in 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.04611

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Approximating vertex cover using edge-based representations
• Approximating vertex cover on dense graphs
• scientific article; zbMATH DE number 5371016
• On the approximability of the vertex cover and related problems
• On approximation of max-vertex-cover
• scientific article; zbMATH DE number 3853131
• scientific article; zbMATH DE number 7525474
• Vertex cover structural parameterization revisited
• On approximability of connected path vertex cover
• Computing and Combinatorics

Cited in

(2)

• scientific article; zbMATH DE number 7525474 (Why is no real title available?)
• Efficient parameterized approximation

This page was built for publication: Approximating V<scp>ertex</scp> C<scp>over</scp> using Structural Rounding

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