On approximating maximum covering cycles in undirected graphs
From MaRDI portal
Publication:2414126
DOI10.1007/s11590-018-1293-3zbMath1420.90074MaRDI QIDQ2414126
Publication date: 10 May 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1293-3
90C35: Programming involving graphs or networks
Cites Work