scientific article; zbMATH DE number 7768372

DOI10.4230/LIPICS.APPROX/RANDOM.2021.27arXiv2107.04837MaRDI QIDQ6090902FDOQ6090902

Author name not available (Why is that?), Stephan Schwartz, Katrin Casel, Author name not available (Why is that?), Ralf Borndörfer, Davis Issac

Publication date: 20 November 2023

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

approximation algorithmsbalanced partitionconnected partitionGyőri-Lovász

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (4)

• On a \(k\)-clique-join of a class of partitionalble graphs
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• Counting connected partitions of graphs
• The path partition conjecture is true for claw-free graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090902)