Approximation of Euclidean k-size cycle cover problem

DOI10.17535/crorr.2014.0006zbMath1329.90121OpenAlexW2136627087MaRDI QIDQ3455967

Katherine Neznakhina, Mikhail Yu. Khachay

Publication date: 11 December 2015

Published in: Croatian Operational Research Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17535/crorr.2014.0006

zbMATH Keywords

traveling salesman problemNP-hard problempolynomial-time approximation schemevertex-disjoint cover

Mathematics Subject Classification ID

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

Related Items (1)

A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension

This page was built for publication: Approximation of Euclidean k-size cycle cover problem