A (2+)-factor approximation algorithm for split vertex deletion

From MaRDI portal

A \((2+\varepsilon)\)-factor approximation algorithm for split vertex deletion

Jump to:navigation, search

DOI10.4230/LIPICS.ICALP.2020.80MaRDI QIDQ6842492zbMATH OpenFDO

Authors Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

zbMATH Keywords

approximation algorithms graph algorithms split vertex deletion

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: A \((2+\varepsilon)\)-factor approximation algorithm for split vertex deletion

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_%5C((2%2B%5Cvarepsilon)%5C)-factor_approximation_algorithm_for_split_vertex_deletion&oldid=74990752"