scientific article; zbMATH DE number 7740881

DOI10.4230/lipics.esa.2021.26arXiv2011.04528MaRDI QIDQ6075914

Davis Issac, Unnamed Author, Katrin Casel, Unnamed Author, Tobias Friedrich

Publication date: 20 September 2023

Full work available at URL: https://arxiv.org/abs/2011.04528

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmsbalanced partitioncrown decompositionconnected partition

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

An overview of graph covering and partitioning ⋮ Approximation and parameterized algorithms for balanced connected partition problems ⋮ Balanced connected partitions of graphs: approximation, parameterization and lower bounds

This page was built for publication: