Approximating minimum \(k\)-section in trees with linear diameter

DOI10.1016/j.endm.2015.07.013zbMath1347.05032arXiv1708.06431OpenAlexW2208485005MaRDI 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

zbMATH Keywords

approximation algorithmminimum \(k\)-section

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)

Related Items (1)

On minimum bisection and related partition problems in graphs with bounded tree width

Cites Work

• Unnamed Item
• Balanced graph partitioning
• Some simplified NP-complete graph problems
• How Good is Recursive Bisection?
• Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs

This page was built for publication: Approximating minimum \(k\)-section in trees with linear diameter