Approximating minimum \(k\)-section in trees with linear diameter
From MaRDI portal
Publication:324723
DOI10.1016/j.endm.2015.07.013zbMath1347.05032arXiv1708.06431MaRDI QIDQ324723
Tina Janne Schmidt, Anusch Taraz, Cristina G. Fernandes
Publication date: 17 October 2016
Full work available at URL: https://arxiv.org/abs/1708.06431
05C05: Trees
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68W25: Approximation algorithms
Related Items
Cites Work