On PTAS for the geometric maximum connected \(k\)-factor problem

DOI10.1007/978-3-030-38603-0_15zbMath1477.90083OpenAlexW2999513600MaRDI QIDQ1982899

E. Kh. Gimadi, I. A. Rykov, O. Yu. Tsidulko

Publication date: 14 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-38603-0_15

zbMATH Keywords

normed spaceNP-hard problemasymptotically optimal algorithmpolynomial time approximation schemeconnected \(k\)-factor problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

This page was built for publication: On PTAS for the geometric maximum connected \(k\)-factor problem